/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:54:03,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:54:03,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:54:04,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:54:04,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:54:04,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:54:04,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:54:04,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:54:04,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:54:04,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:54:04,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:54:04,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:54:04,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:54:04,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:54:04,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:54:04,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:54:04,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:54:04,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:54:04,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:54:04,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:54:04,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:54:04,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:54:04,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:54:04,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:54:04,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:54:04,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:54:04,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:54:04,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:54:04,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:54:04,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:54:04,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:54:04,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:54:04,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:54:04,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:54:04,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:54:04,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:54:04,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:54:04,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:54:04,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:54:04,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:54:04,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:54:04,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:54:04,139 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:54:04,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:54:04,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:54:04,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:54:04,145 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:54:04,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:54:04,145 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:54:04,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:54:04,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:54:04,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:54:04,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:54:04,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:54:04,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:54:04,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:54:04,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:54:04,148 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:54:04,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:54:04,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:54:04,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:54:04,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:54:04,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:54:04,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:54:04,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:54:04,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:54:04,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:54:04,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:54:04,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:54:04,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:54:04,150 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:54:04,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:54:04,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:54:04,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:54:04,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:54:04,567 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:54:04,568 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:54:04,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-11-06 22:54:04,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e943d25b/2eee320947b44d479e15e9c85b072da5/FLAG11d910fc9 [2020-11-06 22:54:05,325 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:54:05,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-11-06 22:54:05,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e943d25b/2eee320947b44d479e15e9c85b072da5/FLAG11d910fc9 [2020-11-06 22:54:05,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e943d25b/2eee320947b44d479e15e9c85b072da5 [2020-11-06 22:54:05,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:54:05,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:54:05,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:54:05,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:54:05,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:54:05,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:54:05" (1/1) ... [2020-11-06 22:54:05,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4a3833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:05, skipping insertion in model container [2020-11-06 22:54:05,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:54:05" (1/1) ... [2020-11-06 22:54:05,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:54:05,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:54:05,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:54:05,925 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:54:05,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:54:06,015 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:54:06,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06 WrapperNode [2020-11-06 22:54:06,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:54:06,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:54:06,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:54:06,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:54:06,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... [2020-11-06 22:54:06,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:54:06,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:54:06,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:54:06,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:54:06,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-11-06 22:54:06,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:54:06,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:54:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:54:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-06 22:54:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-06 22:54:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-06 22:54:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-11-06 22:54:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-06 22:54:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-06 22:54:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-11-06 22:54:06,182 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-06 22:54:06,182 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-06 22:54:06,182 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-06 22:54:06,183 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-06 22:54:06,183 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-06 22:54:06,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-06 22:54:06,184 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-06 22:54:06,184 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-06 22:54:06,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-06 22:54:06,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-06 22:54:06,185 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-06 22:54:06,185 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-06 22:54:06,185 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-06 22:54:06,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-06 22:54:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-06 22:54:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-06 22:54:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-11-06 22:54:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-06 22:54:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-06 22:54:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-06 22:54:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-06 22:54:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:54:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:54:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:54:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:54:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:54:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:54:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:54:06,804 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:54:06,804 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-06 22:54:06,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:06 BoogieIcfgContainer [2020-11-06 22:54:06,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:54:06,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:54:06,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:54:06,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:54:06,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:54:05" (1/3) ... [2020-11-06 22:54:06,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31993919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:54:06, skipping insertion in model container [2020-11-06 22:54:06,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:06" (2/3) ... [2020-11-06 22:54:06,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31993919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:54:06, skipping insertion in model container [2020-11-06 22:54:06,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:06" (3/3) ... [2020-11-06 22:54:06,818 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-11-06 22:54:06,837 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:54:06,841 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:54:06,857 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:54:06,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:54:06,891 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:54:06,891 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:54:06,891 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:54:06,891 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:54:06,892 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:54:06,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:54:06,892 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:54:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2020-11-06 22:54:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:06,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:06,932 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] [2020-11-06 22:54:06,932 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:06,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1259976034, now seen corresponding path program 1 times [2020-11-06 22:54:06,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:06,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998631124] [2020-11-06 22:54:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:07,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998631124] [2020-11-06 22:54:07,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:07,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:54:07,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336351534] [2020-11-06 22:54:07,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:54:07,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:54:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:54:07,718 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 9 states. [2020-11-06 22:54:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:10,662 INFO L93 Difference]: Finished difference Result 613 states and 953 transitions. [2020-11-06 22:54:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:54:10,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2020-11-06 22:54:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:10,684 INFO L225 Difference]: With dead ends: 613 [2020-11-06 22:54:10,684 INFO L226 Difference]: Without dead ends: 441 [2020-11-06 22:54:10,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-06 22:54:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 295. [2020-11-06 22:54:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-06 22:54:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2020-11-06 22:54:10,849 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 91 [2020-11-06 22:54:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:10,850 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2020-11-06 22:54:10,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:54:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2020-11-06 22:54:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:10,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:10,856 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] [2020-11-06 22:54:10,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:54:10,857 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash -351665279, now seen corresponding path program 1 times [2020-11-06 22:54:10,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:10,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880720303] [2020-11-06 22:54:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:11,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880720303] [2020-11-06 22:54:11,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:11,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:11,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226730966] [2020-11-06 22:54:11,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:11,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:11,246 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 10 states. [2020-11-06 22:54:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:12,816 INFO L93 Difference]: Finished difference Result 706 states and 996 transitions. [2020-11-06 22:54:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:54:12,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-11-06 22:54:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:12,826 INFO L225 Difference]: With dead ends: 706 [2020-11-06 22:54:12,827 INFO L226 Difference]: Without dead ends: 431 [2020-11-06 22:54:12,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:54:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-11-06 22:54:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 295. [2020-11-06 22:54:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-06 22:54:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 388 transitions. [2020-11-06 22:54:12,914 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 388 transitions. Word has length 91 [2020-11-06 22:54:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:12,914 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 388 transitions. [2020-11-06 22:54:12,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 388 transitions. [2020-11-06 22:54:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:12,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:12,917 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] [2020-11-06 22:54:12,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:54:12,917 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1988478273, now seen corresponding path program 1 times [2020-11-06 22:54:12,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:12,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414632418] [2020-11-06 22:54:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:13,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414632418] [2020-11-06 22:54:13,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:13,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:13,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269297174] [2020-11-06 22:54:13,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:13,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:13,181 INFO L87 Difference]: Start difference. First operand 295 states and 388 transitions. Second operand 10 states. [2020-11-06 22:54:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:14,670 INFO L93 Difference]: Finished difference Result 702 states and 974 transitions. [2020-11-06 22:54:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:54:14,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-11-06 22:54:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:14,677 INFO L225 Difference]: With dead ends: 702 [2020-11-06 22:54:14,677 INFO L226 Difference]: Without dead ends: 427 [2020-11-06 22:54:14,679 INFO L677 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-11-06 22:54:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-06 22:54:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 295. [2020-11-06 22:54:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-06 22:54:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 381 transitions. [2020-11-06 22:54:14,749 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 381 transitions. Word has length 91 [2020-11-06 22:54:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:14,751 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 381 transitions. [2020-11-06 22:54:14,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 381 transitions. [2020-11-06 22:54:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:14,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:14,760 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] [2020-11-06 22:54:14,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:54:14,760 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash 262851457, now seen corresponding path program 1 times [2020-11-06 22:54:14,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:14,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833414373] [2020-11-06 22:54:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:14,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:14,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:14,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:15,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833414373] [2020-11-06 22:54:15,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:15,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:15,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600091536] [2020-11-06 22:54:15,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:15,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:15,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:15,095 INFO L87 Difference]: Start difference. First operand 295 states and 381 transitions. Second operand 10 states. [2020-11-06 22:54:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:17,177 INFO L93 Difference]: Finished difference Result 853 states and 1225 transitions. [2020-11-06 22:54:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:54:17,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-11-06 22:54:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:17,183 INFO L225 Difference]: With dead ends: 853 [2020-11-06 22:54:17,184 INFO L226 Difference]: Without dead ends: 578 [2020-11-06 22:54:17,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:54:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-11-06 22:54:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 367. [2020-11-06 22:54:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-11-06 22:54:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 459 transitions. [2020-11-06 22:54:17,249 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 459 transitions. Word has length 91 [2020-11-06 22:54:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:17,249 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 459 transitions. [2020-11-06 22:54:17,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 459 transitions. [2020-11-06 22:54:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:17,257 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:17,258 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] [2020-11-06 22:54:17,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:54:17,258 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:17,259 INFO L82 PathProgramCache]: Analyzing trace with hash -469115969, now seen corresponding path program 1 times [2020-11-06 22:54:17,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:17,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126233842] [2020-11-06 22:54:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:17,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126233842] [2020-11-06 22:54:17,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:17,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:54:17,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770262018] [2020-11-06 22:54:17,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:54:17,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:17,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:54:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:54:17,547 INFO L87 Difference]: Start difference. First operand 367 states and 459 transitions. Second operand 9 states. [2020-11-06 22:54:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:19,196 INFO L93 Difference]: Finished difference Result 934 states and 1239 transitions. [2020-11-06 22:54:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:54:19,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2020-11-06 22:54:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:19,203 INFO L225 Difference]: With dead ends: 934 [2020-11-06 22:54:19,203 INFO L226 Difference]: Without dead ends: 587 [2020-11-06 22:54:19,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:54:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-11-06 22:54:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2020-11-06 22:54:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-11-06 22:54:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 525 transitions. [2020-11-06 22:54:19,301 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 525 transitions. Word has length 91 [2020-11-06 22:54:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:19,302 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 525 transitions. [2020-11-06 22:54:19,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:54:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 525 transitions. [2020-11-06 22:54:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:19,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:19,306 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] [2020-11-06 22:54:19,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:54:19,306 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1693264994, now seen corresponding path program 1 times [2020-11-06 22:54:19,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:19,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15061173] [2020-11-06 22:54:19,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:19,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15061173] [2020-11-06 22:54:19,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:19,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:19,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031862638] [2020-11-06 22:54:19,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:19,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:19,569 INFO L87 Difference]: Start difference. First operand 433 states and 525 transitions. Second operand 10 states. [2020-11-06 22:54:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:21,509 INFO L93 Difference]: Finished difference Result 1020 states and 1306 transitions. [2020-11-06 22:54:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:54:21,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-11-06 22:54:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:21,514 INFO L225 Difference]: With dead ends: 1020 [2020-11-06 22:54:21,515 INFO L226 Difference]: Without dead ends: 608 [2020-11-06 22:54:21,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:54:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-11-06 22:54:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 448. [2020-11-06 22:54:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-11-06 22:54:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2020-11-06 22:54:21,582 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 91 [2020-11-06 22:54:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:21,583 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2020-11-06 22:54:21,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2020-11-06 22:54:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:21,584 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:21,584 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] [2020-11-06 22:54:21,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:54:21,585 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash -154924964, now seen corresponding path program 1 times [2020-11-06 22:54:21,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:21,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153742761] [2020-11-06 22:54:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:21,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153742761] [2020-11-06 22:54:21,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:21,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:21,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843973407] [2020-11-06 22:54:21,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:21,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:21,818 INFO L87 Difference]: Start difference. First operand 448 states and 537 transitions. Second operand 10 states. [2020-11-06 22:54:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:23,662 INFO L93 Difference]: Finished difference Result 1033 states and 1305 transitions. [2020-11-06 22:54:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:54:23,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-11-06 22:54:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:23,667 INFO L225 Difference]: With dead ends: 1033 [2020-11-06 22:54:23,667 INFO L226 Difference]: Without dead ends: 606 [2020-11-06 22:54:23,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-11-06 22:54:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 458. [2020-11-06 22:54:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-06 22:54:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 543 transitions. [2020-11-06 22:54:23,731 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 543 transitions. Word has length 91 [2020-11-06 22:54:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:23,731 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 543 transitions. [2020-11-06 22:54:23,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 543 transitions. [2020-11-06 22:54:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:23,733 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:23,733 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] [2020-11-06 22:54:23,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:54:23,733 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1052318242, now seen corresponding path program 1 times [2020-11-06 22:54:23,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:23,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690941646] [2020-11-06 22:54:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:23,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690941646] [2020-11-06 22:54:23,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:23,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:23,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745310056] [2020-11-06 22:54:23,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:23,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:23,986 INFO L87 Difference]: Start difference. First operand 458 states and 543 transitions. Second operand 10 states. [2020-11-06 22:54:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:25,833 INFO L93 Difference]: Finished difference Result 1048 states and 1307 transitions. [2020-11-06 22:54:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:54:25,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-11-06 22:54:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:25,837 INFO L225 Difference]: With dead ends: 1048 [2020-11-06 22:54:25,838 INFO L226 Difference]: Without dead ends: 611 [2020-11-06 22:54:25,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-11-06 22:54:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 468. [2020-11-06 22:54:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-11-06 22:54:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 549 transitions. [2020-11-06 22:54:25,909 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 549 transitions. Word has length 91 [2020-11-06 22:54:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:25,909 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 549 transitions. [2020-11-06 22:54:25,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 549 transitions. [2020-11-06 22:54:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-06 22:54:25,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:25,911 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] [2020-11-06 22:54:25,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:54:25,911 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 998665756, now seen corresponding path program 1 times [2020-11-06 22:54:25,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:25,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873987975] [2020-11-06 22:54:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:26,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873987975] [2020-11-06 22:54:26,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:26,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:54:26,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947438794] [2020-11-06 22:54:26,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:54:26,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:54:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:54:26,126 INFO L87 Difference]: Start difference. First operand 468 states and 549 transitions. Second operand 8 states. [2020-11-06 22:54:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:28,743 INFO L93 Difference]: Finished difference Result 1672 states and 2206 transitions. [2020-11-06 22:54:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-06 22:54:28,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2020-11-06 22:54:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:28,752 INFO L225 Difference]: With dead ends: 1672 [2020-11-06 22:54:28,752 INFO L226 Difference]: Without dead ends: 1226 [2020-11-06 22:54:28,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-11-06 22:54:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 853. [2020-11-06 22:54:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-11-06 22:54:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1028 transitions. [2020-11-06 22:54:28,904 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1028 transitions. Word has length 91 [2020-11-06 22:54:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:28,905 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1028 transitions. [2020-11-06 22:54:28,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:54:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1028 transitions. [2020-11-06 22:54:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-06 22:54:28,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:28,907 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-11-06 22:54:28,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:54:28,908 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash 302356099, now seen corresponding path program 1 times [2020-11-06 22:54:28,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:28,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818574307] [2020-11-06 22:54:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:29,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818574307] [2020-11-06 22:54:29,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:29,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:54:29,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674244766] [2020-11-06 22:54:29,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:54:29,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:54:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:54:29,172 INFO L87 Difference]: Start difference. First operand 853 states and 1028 transitions. Second operand 8 states. [2020-11-06 22:54:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:32,006 INFO L93 Difference]: Finished difference Result 3058 states and 4365 transitions. [2020-11-06 22:54:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-06 22:54:32,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2020-11-06 22:54:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:32,025 INFO L225 Difference]: With dead ends: 3058 [2020-11-06 22:54:32,026 INFO L226 Difference]: Without dead ends: 2234 [2020-11-06 22:54:32,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2020-11-06 22:54:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1538. [2020-11-06 22:54:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2020-11-06 22:54:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1920 transitions. [2020-11-06 22:54:32,299 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1920 transitions. Word has length 92 [2020-11-06 22:54:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:32,300 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 1920 transitions. [2020-11-06 22:54:32,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:54:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1920 transitions. [2020-11-06 22:54:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-06 22:54:32,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:32,303 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-11-06 22:54:32,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:54:32,303 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2036460549, now seen corresponding path program 1 times [2020-11-06 22:54:32,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:32,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851055754] [2020-11-06 22:54:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:32,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851055754] [2020-11-06 22:54:32,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:32,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:54:32,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469908329] [2020-11-06 22:54:32,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:54:32,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:54:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:54:32,486 INFO L87 Difference]: Start difference. First operand 1538 states and 1920 transitions. Second operand 8 states. [2020-11-06 22:54:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:34,037 INFO L93 Difference]: Finished difference Result 3511 states and 4628 transitions. [2020-11-06 22:54:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:54:34,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2020-11-06 22:54:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:34,052 INFO L225 Difference]: With dead ends: 3511 [2020-11-06 22:54:34,052 INFO L226 Difference]: Without dead ends: 2002 [2020-11-06 22:54:34,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:54:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2020-11-06 22:54:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1526. [2020-11-06 22:54:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2020-11-06 22:54:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1898 transitions. [2020-11-06 22:54:34,314 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1898 transitions. Word has length 92 [2020-11-06 22:54:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:34,315 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 1898 transitions. [2020-11-06 22:54:34,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:54:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1898 transitions. [2020-11-06 22:54:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-06 22:54:34,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:34,317 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, 1] [2020-11-06 22:54:34,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:54:34,317 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:34,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 950701723, now seen corresponding path program 1 times [2020-11-06 22:54:34,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:34,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002263339] [2020-11-06 22:54:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:34,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002263339] [2020-11-06 22:54:34,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:34,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:54:34,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436781093] [2020-11-06 22:54:34,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:54:34,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:54:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:54:34,506 INFO L87 Difference]: Start difference. First operand 1526 states and 1898 transitions. Second operand 7 states. [2020-11-06 22:54:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:36,800 INFO L93 Difference]: Finished difference Result 5365 states and 7550 transitions. [2020-11-06 22:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:54:36,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2020-11-06 22:54:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:36,828 INFO L225 Difference]: With dead ends: 5365 [2020-11-06 22:54:36,828 INFO L226 Difference]: Without dead ends: 3866 [2020-11-06 22:54:36,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 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-11-06 22:54:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2020-11-06 22:54:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3029. [2020-11-06 22:54:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3029 states. [2020-11-06 22:54:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3844 transitions. [2020-11-06 22:54:37,291 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3844 transitions. Word has length 93 [2020-11-06 22:54:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:37,292 INFO L481 AbstractCegarLoop]: Abstraction has 3029 states and 3844 transitions. [2020-11-06 22:54:37,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:54:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3844 transitions. [2020-11-06 22:54:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-06 22:54:37,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:37,296 INFO L422 BasicCegarLoop]: trace histogram [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-11-06 22:54:37,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:54:37,296 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1909484935, now seen corresponding path program 1 times [2020-11-06 22:54:37,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:37,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500862727] [2020-11-06 22:54:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-06 22:54:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:54:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:54:37,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500862727] [2020-11-06 22:54:37,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:37,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:37,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261099678] [2020-11-06 22:54:37,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:37,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:37,505 INFO L87 Difference]: Start difference. First operand 3029 states and 3844 transitions. Second operand 10 states. [2020-11-06 22:54:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:43,718 INFO L93 Difference]: Finished difference Result 14518 states and 22150 transitions. [2020-11-06 22:54:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-06 22:54:43,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2020-11-06 22:54:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:43,780 INFO L225 Difference]: With dead ends: 14518 [2020-11-06 22:54:43,781 INFO L226 Difference]: Without dead ends: 8056 [2020-11-06 22:54:43,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2020-11-06 22:54:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2020-11-06 22:54:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 6258. [2020-11-06 22:54:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6258 states. [2020-11-06 22:54:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 8406 transitions. [2020-11-06 22:54:44,888 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 8406 transitions. Word has length 114 [2020-11-06 22:54:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:44,888 INFO L481 AbstractCegarLoop]: Abstraction has 6258 states and 8406 transitions. [2020-11-06 22:54:44,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 8406 transitions. [2020-11-06 22:54:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-11-06 22:54:44,894 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:44,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:54:44,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:54:44,895 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1716439577, now seen corresponding path program 1 times [2020-11-06 22:54:44,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:44,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091673495] [2020-11-06 22:54:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-06 22:54:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:54:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-06 22:54:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-11-06 22:54:45,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091673495] [2020-11-06 22:54:45,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:45,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:45,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543571546] [2020-11-06 22:54:45,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:45,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:45,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:45,170 INFO L87 Difference]: Start difference. First operand 6258 states and 8406 transitions. Second operand 10 states. [2020-11-06 22:54:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:49,095 INFO L93 Difference]: Finished difference Result 15499 states and 23554 transitions. [2020-11-06 22:54:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:54:49,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2020-11-06 22:54:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:49,184 INFO L225 Difference]: With dead ends: 15499 [2020-11-06 22:54:49,184 INFO L226 Difference]: Without dead ends: 9268 [2020-11-06 22:54:49,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:54:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9268 states. [2020-11-06 22:54:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9268 to 8308. [2020-11-06 22:54:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8308 states. [2020-11-06 22:54:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8308 states to 8308 states and 11336 transitions. [2020-11-06 22:54:50,608 INFO L78 Accepts]: Start accepts. Automaton has 8308 states and 11336 transitions. Word has length 157 [2020-11-06 22:54:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:50,609 INFO L481 AbstractCegarLoop]: Abstraction has 8308 states and 11336 transitions. [2020-11-06 22:54:50,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 8308 states and 11336 transitions. [2020-11-06 22:54:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-06 22:54:50,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:50,619 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, 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] [2020-11-06 22:54:50,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:54:50,619 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1176280823, now seen corresponding path program 1 times [2020-11-06 22:54:50,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:50,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157471079] [2020-11-06 22:54:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-06 22:54:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:54:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-06 22:54:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:54:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:54:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-11-06 22:54:50,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157471079] [2020-11-06 22:54:50,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:54:50,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:54:50,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525329805] [2020-11-06 22:54:50,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:54:50,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:54:50,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:54:50,881 INFO L87 Difference]: Start difference. First operand 8308 states and 11336 transitions. Second operand 10 states. [2020-11-06 22:54:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:53,475 INFO L93 Difference]: Finished difference Result 17547 states and 24575 transitions. [2020-11-06 22:54:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:54:53,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 164 [2020-11-06 22:54:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:53,514 INFO L225 Difference]: With dead ends: 17547 [2020-11-06 22:54:53,515 INFO L226 Difference]: Without dead ends: 9261 [2020-11-06 22:54:53,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9261 states. [2020-11-06 22:54:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9261 to 8301. [2020-11-06 22:54:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8301 states. [2020-11-06 22:54:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 11325 transitions. [2020-11-06 22:54:54,705 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 11325 transitions. Word has length 164 [2020-11-06 22:54:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:54,705 INFO L481 AbstractCegarLoop]: Abstraction has 8301 states and 11325 transitions. [2020-11-06 22:54:54,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:54:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 11325 transitions. [2020-11-06 22:54:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-06 22:54:54,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:54,713 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, 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] [2020-11-06 22:54:54,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:54:54,713 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1440928313, now seen corresponding path program 1 times [2020-11-06 22:54:54,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:54,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692800596] [2020-11-06 22:54:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-06 22:54:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:54:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-06 22:54:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:54:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:54,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:54:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-11-06 22:54:55,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692800596] [2020-11-06 22:54:55,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501677520] [2020-11-06 22:54:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-11-06 22:54:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:55,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:54:55,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:54:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:54:55,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:54:55,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-11-06 22:54:55,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755852888] [2020-11-06 22:54:55,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:54:55,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:55,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:54:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:54:55,281 INFO L87 Difference]: Start difference. First operand 8301 states and 11325 transitions. Second operand 3 states. [2020-11-06 22:54:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:56,780 INFO L93 Difference]: Finished difference Result 14860 states and 20901 transitions. [2020-11-06 22:54:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:54:56,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2020-11-06 22:54:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:56,863 INFO L225 Difference]: With dead ends: 14860 [2020-11-06 22:54:56,863 INFO L226 Difference]: Without dead ends: 8133 [2020-11-06 22:54:56,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:54:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8133 states. [2020-11-06 22:54:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8133 to 7975. [2020-11-06 22:54:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7975 states. [2020-11-06 22:54:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7975 states to 7975 states and 10427 transitions. [2020-11-06 22:54:58,455 INFO L78 Accepts]: Start accepts. Automaton has 7975 states and 10427 transitions. Word has length 164 [2020-11-06 22:54:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:58,456 INFO L481 AbstractCegarLoop]: Abstraction has 7975 states and 10427 transitions. [2020-11-06 22:54:58,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:54:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7975 states and 10427 transitions. [2020-11-06 22:54:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-06 22:54:58,465 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:58,465 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, 2, 2, 2, 2, 2, 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] [2020-11-06 22:54:58,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-06 22:54:58,679 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1750641979, now seen corresponding path program 1 times [2020-11-06 22:54:58,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:58,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299723323] [2020-11-06 22:54:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:54:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:54:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:54:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-06 22:54:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:54:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-06 22:54:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-06 22:54:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:54:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-11-06 22:54:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:58,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:54:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-11-06 22:54:59,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299723323] [2020-11-06 22:54:59,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966762721] [2020-11-06 22:54:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-11-06 22:54:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:59,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-06 22:54:59,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:54:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-06 22:54:59,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:54:59,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-11-06 22:54:59,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384782727] [2020-11-06 22:54:59,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:54:59,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:54:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:54:59,216 INFO L87 Difference]: Start difference. First operand 7975 states and 10427 transitions. Second operand 3 states. [2020-11-06 22:55:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:55:00,476 INFO L93 Difference]: Finished difference Result 13594 states and 18656 transitions. [2020-11-06 22:55:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:55:00,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2020-11-06 22:55:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:55:00,510 INFO L225 Difference]: With dead ends: 13594 [2020-11-06 22:55:00,511 INFO L226 Difference]: Without dead ends: 7975 [2020-11-06 22:55:00,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:55:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2020-11-06 22:55:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 7892. [2020-11-06 22:55:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7892 states. [2020-11-06 22:55:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 10082 transitions. [2020-11-06 22:55:01,747 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 10082 transitions. Word has length 207 [2020-11-06 22:55:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:55:01,748 INFO L481 AbstractCegarLoop]: Abstraction has 7892 states and 10082 transitions. [2020-11-06 22:55:01,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:55:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 10082 transitions. [2020-11-06 22:55:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-11-06 22:55:01,757 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:55:01,757 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, 2, 2, 2, 2, 2, 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-11-06 22:55:01,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-06 22:55:01,970 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:55:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:55:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 251615912, now seen corresponding path program 1 times [2020-11-06 22:55:01,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:55:01,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384094497] [2020-11-06 22:55:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:55:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,187 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-06 22:55:02,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:55:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:55:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:55:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:55:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:55:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:55:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:55:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:55:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:55:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-06 22:55:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:55:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-06 22:55:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-06 22:55:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:55:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:55:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:55:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-11-06 22:55:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:55:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:55:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:55:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-06 22:55:02,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384094497] [2020-11-06 22:55:02,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:55:02,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:55:02,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546612252] [2020-11-06 22:55:02,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:55:02,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:55:02,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:55:02,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:55:02,484 INFO L87 Difference]: Start difference. First operand 7892 states and 10082 transitions. Second operand 11 states. [2020-11-06 22:55:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:55:06,255 INFO L93 Difference]: Finished difference Result 15012 states and 20066 transitions. [2020-11-06 22:55:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:55:06,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 208 [2020-11-06 22:55:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:55:06,272 INFO L225 Difference]: With dead ends: 15012 [2020-11-06 22:55:06,272 INFO L226 Difference]: Without dead ends: 3207 [2020-11-06 22:55:06,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:55:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2020-11-06 22:55:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3024. [2020-11-06 22:55:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2020-11-06 22:55:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 3513 transitions. [2020-11-06 22:55:06,755 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 3513 transitions. Word has length 208 [2020-11-06 22:55:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:55:06,756 INFO L481 AbstractCegarLoop]: Abstraction has 3024 states and 3513 transitions. [2020-11-06 22:55:06,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:55:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3513 transitions. [2020-11-06 22:55:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-06 22:55:06,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:55:06,760 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, 2, 2, 2, 2, 2, 2, 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] [2020-11-06 22:55:06,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:55:06,761 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:55:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:55:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -287072908, now seen corresponding path program 1 times [2020-11-06 22:55:06,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:55:06,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128734205] [2020-11-06 22:55:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:55:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:55:06,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:55:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:55:06,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:55:06,908 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:55:06,908 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:55:06,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:55:07,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:55:07 BoogieIcfgContainer [2020-11-06 22:55:07,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:55:07,124 INFO L168 Benchmark]: Toolchain (without parser) took 61479.20 ms. Allocated memory was 155.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 130.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 525.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:55:07,129 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 155.2 MB. Free memory is still 129.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:55:07,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.60 ms. Allocated memory is still 155.2 MB. Free memory was 129.7 MB in the beginning and 116.4 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:55:07,134 INFO L168 Benchmark]: Boogie Preprocessor took 53.51 ms. Allocated memory is still 155.2 MB. Free memory was 116.4 MB in the beginning and 114.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:55:07,135 INFO L168 Benchmark]: RCFGBuilder took 735.95 ms. Allocated memory is still 155.2 MB. Free memory was 114.3 MB in the beginning and 77.2 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:55:07,135 INFO L168 Benchmark]: TraceAbstraction took 60309.53 ms. Allocated memory was 155.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 76.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 471.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:55:07,141 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 155.2 MB. Free memory is still 129.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 365.60 ms. Allocated memory is still 155.2 MB. Free memory was 129.7 MB in the beginning and 116.4 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.51 ms. Allocated memory is still 155.2 MB. Free memory was 116.4 MB in the beginning and 114.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 735.95 ms. Allocated memory is still 155.2 MB. Free memory was 114.3 MB in the beginning and 77.2 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 60309.53 ms. Allocated memory was 155.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 76.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 471.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; VAL [\old(E_1)=70, \old(E_2)=53, \old(M_E)=67, \old(m_i)=54, \old(m_pc)=62, \old(m_st)=60, \old(T1_E)=50, \old(t1_i)=68, \old(t1_pc)=57, \old(t1_st)=51, \old(T2_E)=65, \old(t2_i)=55, \old(t2_pc)=56, \old(t2_st)=59, E_1=2, E_2=2, 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] [L565] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L569] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L569] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L570] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L513] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L514] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L213] COND TRUE m_i == 1 [L214] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L514] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L515] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L326] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L331] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L336] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L341] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L346] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L515] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L516] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L395] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L145] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L148] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L158] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, 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] [L160] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, 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] [L395] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_master_triggered()=0, 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] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L403] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L164] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L167] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L177] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, 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] [L179] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, 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] [L403] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit1_triggered()=0, 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] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L411] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L183] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L186] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L196] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, 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] [L198] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, 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] [L411] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit2_triggered()=0, 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] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L516] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L517] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L359] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L364] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L369] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L374] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L379] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L517] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L520] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, 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] [L523] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=1, 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] [L524] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L259] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L263] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L266] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L233] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, 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] [L254] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, 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] [L266] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, 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] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=-1] [L293] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L80] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L91] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L293] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=-1] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=-1, tmp_ndt_3=-2] [L307] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, 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] [L115] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, 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] [L126] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, 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] [L128] t2_pc = 1 [L129] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, 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] [L307] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=-1, tmp_ndt_3=-2] [L263] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=-1, tmp_ndt_3=-2] [L266] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L233] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, 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] [L254] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, 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] [L266] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, 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=-1, tmp_ndt_3=-2] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=-1, tmp_ndt_3=-2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=1, tmp_ndt_2=-1, tmp_ndt_3=-2] [L279] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L39] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L53] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L54] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L427] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L395] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L145] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L148] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L158] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=0, E_1=1, E_2=2, 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] [L160] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=0, __retres1=0, E_1=1, E_2=2, 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] [L395] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, is_master_triggered()=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] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L403] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L164] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L167] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=1, E_1=1, E_2=2, 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] [L179] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=1, __retres1=1, E_1=1, E_2=2, 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] [L403] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, is_transmit1_triggered()=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] [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L411] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L183] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L186] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L187] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L196] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=0, E_1=1, E_2=2, 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] [L198] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=0, __retres1=0, E_1=1, E_2=2, 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] [L411] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L427] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L54] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L55] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L58] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L60] m_pc = 1 [L61] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L279] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=1, tmp_ndt_2=-1, tmp_ndt_3=-2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=1, tmp_ndt_2=-3, tmp_ndt_3=-2] [L293] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=2, 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] [L80] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=2, 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] [L83] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=2, 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] [L99] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L100] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L427] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L395] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L145] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L148] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L149] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L158] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, __retres1=0, E_1=2, E_2=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] [L160] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, \result=0, __retres1=0, E_1=2, E_2=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] [L395] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L403] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L164] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L167] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L168] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L177] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, __retres1=0, E_1=2, E_2=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] [L179] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, \result=0, __retres1=0, E_1=2, E_2=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] [L403] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=1, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L411] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L183] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L186] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, __retres1=1, E_1=2, E_2=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] [L198] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, \result=1, __retres1=1, E_1=2, E_2=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] [L411] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=1, is_transmit2_triggered()=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] [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L427] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L100] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=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] [L101] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=2, 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] [L91] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=2, 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] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=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, E_1=2, E_2=2, 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] [L293] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=1, tmp_ndt_2=-3, tmp_ndt_3=-2] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, 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=1, tmp_ndt_2=-3, tmp_ndt_3=-4] [L307] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L115] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L118] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L134] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L13] CALL reach_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L3] __assert_fail("0", "transmitter.02.cil.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 173 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 60.0s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 44.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3136 SDtfs, 12417 SDslu, 1049 SDs, 0 SdLazy, 16794 SolverSat, 6538 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1259 GetRequests, 953 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8308occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 7754 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2690 NumberOfCodeBlocks, 2690 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2461 ConstructedInterpolants, 0 QuantifiedInterpolants, 809929 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1641 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 548/559 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...