/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 00:33:19,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 00:33:19,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 00:33:19,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 00:33:19,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 00:33:19,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 00:33:19,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 00:33:19,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 00:33:19,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 00:33:19,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 00:33:19,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 00:33:19,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 00:33:19,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 00:33:19,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 00:33:19,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 00:33:19,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 00:33:19,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 00:33:19,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 00:33:19,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 00:33:19,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 00:33:19,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 00:33:19,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 00:33:19,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 00:33:19,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 00:33:19,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 00:33:19,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 00:33:19,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 00:33:19,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 00:33:19,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 00:33:19,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 00:33:19,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 00:33:19,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 00:33:19,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 00:33:19,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 00:33:19,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 00:33:19,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 00:33:19,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 00:33:19,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 00:33:19,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 00:33:19,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 00:33:19,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 00:33:19,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-24 00:33:19,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 00:33:19,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 00:33:19,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 00:33:19,573 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 00:33:19,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 00:33:19,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 00:33:19,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 00:33:19,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 00:33:19,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 00:33:19,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 00:33:19,576 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 00:33:19,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 00:33:19,576 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 00:33:19,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 00:33:19,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 00:33:19,577 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 00:33:19,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 00:33:19,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 00:33:19,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 00:33:19,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 00:33:19,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 00:33:19,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 00:33:19,579 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-24 00:33:19,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 00:33:20,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 00:33:20,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 00:33:20,015 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 00:33:20,016 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 00:33:20,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2021-02-24 00:33:20,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4a71d508/2baa15b50e5b4b55b8e7281e595d0dad/FLAG2f1e2d95b [2021-02-24 00:33:20,824 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 00:33:20,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2021-02-24 00:33:20,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4a71d508/2baa15b50e5b4b55b8e7281e595d0dad/FLAG2f1e2d95b [2021-02-24 00:33:21,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4a71d508/2baa15b50e5b4b55b8e7281e595d0dad [2021-02-24 00:33:21,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 00:33:21,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 00:33:21,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 00:33:21,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 00:33:21,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 00:33:21,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a19361f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21, skipping insertion in model container [2021-02-24 00:33:21,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 00:33:21,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 00:33:21,364 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[401,414] [2021-02-24 00:33:21,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:33:21,436 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 00:33:21,448 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[401,414] [2021-02-24 00:33:21,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:33:21,540 INFO L208 MainTranslator]: Completed translation [2021-02-24 00:33:21,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21 WrapperNode [2021-02-24 00:33:21,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 00:33:21,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 00:33:21,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 00:33:21,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 00:33:21,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (1/1) ... [2021-02-24 00:33:21,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 00:33:21,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 00:33:21,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 00:33:21,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 00:33:21,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (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 [2021-02-24 00:33:21,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 00:33:21,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 00:33:21,700 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 00:33:21,701 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-24 00:33:21,701 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2021-02-24 00:33:21,701 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2021-02-24 00:33:21,701 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2021-02-24 00:33:21,701 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2021-02-24 00:33:21,701 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2021-02-24 00:33:21,702 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2021-02-24 00:33:21,702 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-24 00:33:21,702 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-24 00:33:21,702 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-24 00:33:21,702 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-24 00:33:21,702 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-24 00:33:21,703 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-24 00:33:21,703 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-24 00:33:21,703 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-02-24 00:33:21,703 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2021-02-24 00:33:21,703 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2021-02-24 00:33:21,703 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-24 00:33:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-24 00:33:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-24 00:33:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 00:33:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 00:33:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 00:33:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 00:33:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 00:33:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 00:33:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-24 00:33:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2021-02-24 00:33:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2021-02-24 00:33:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure master [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-24 00:33:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-24 00:33:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 00:33:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 00:33:22,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 00:33:22,594 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-02-24 00:33:22,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:33:22 BoogieIcfgContainer [2021-02-24 00:33:22,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 00:33:22,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 00:33:22,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 00:33:22,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 00:33:22,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:33:21" (1/3) ... [2021-02-24 00:33:22,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4443a80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:33:22, skipping insertion in model container [2021-02-24 00:33:22,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:33:21" (2/3) ... [2021-02-24 00:33:22,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4443a80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:33:22, skipping insertion in model container [2021-02-24 00:33:22,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:33:22" (3/3) ... [2021-02-24 00:33:22,611 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-02-24 00:33:22,619 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 00:33:22,627 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 00:33:22,648 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 00:33:22,684 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 00:33:22,684 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 00:33:22,684 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-24 00:33:22,685 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 00:33:22,685 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 00:33:22,685 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 00:33:22,686 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 00:33:22,686 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 00:33:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2021-02-24 00:33:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-02-24 00:33:22,733 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:22,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:22,735 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1980759665, now seen corresponding path program 1 times [2021-02-24 00:33:22,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:22,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1143645961] [2021-02-24 00:33:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,089 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:23,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,106 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,225 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,254 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,255 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,256 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:23,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,286 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,287 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:23,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,321 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,344 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,345 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,368 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,369 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:23,403 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:23,404 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:33:23,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1143645961] [2021-02-24 00:33:23,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:23,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-24 00:33:23,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918591428] [2021-02-24 00:33:23,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:33:23,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:33:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:33:23,496 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 8 states. [2021-02-24 00:33:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:25,892 INFO L93 Difference]: Finished difference Result 637 states and 851 transitions. [2021-02-24 00:33:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-24 00:33:25,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2021-02-24 00:33:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:25,940 INFO L225 Difference]: With dead ends: 637 [2021-02-24 00:33:25,940 INFO L226 Difference]: Without dead ends: 402 [2021-02-24 00:33:25,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-02-24 00:33:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-02-24 00:33:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 254. [2021-02-24 00:33:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-02-24 00:33:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 306 transitions. [2021-02-24 00:33:26,150 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 306 transitions. Word has length 135 [2021-02-24 00:33:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:26,152 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 306 transitions. [2021-02-24 00:33:26,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:33:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 306 transitions. [2021-02-24 00:33:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-02-24 00:33:26,164 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:26,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:26,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 00:33:26,165 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1885481489, now seen corresponding path program 1 times [2021-02-24 00:33:26,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:26,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763694482] [2021-02-24 00:33:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,369 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,371 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,374 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:26,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:26,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:26,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,524 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,524 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:26,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,603 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,604 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:26,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,674 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,674 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,682 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,695 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,696 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:26,701 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,702 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:26,704 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:26,704 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:33:26,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763694482] [2021-02-24 00:33:26,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:26,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-24 00:33:26,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047198094] [2021-02-24 00:33:26,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:33:26,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:33:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:33:26,751 INFO L87 Difference]: Start difference. First operand 254 states and 306 transitions. Second operand 8 states. [2021-02-24 00:33:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:29,842 INFO L93 Difference]: Finished difference Result 1088 states and 1490 transitions. [2021-02-24 00:33:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-24 00:33:29,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2021-02-24 00:33:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:29,863 INFO L225 Difference]: With dead ends: 1088 [2021-02-24 00:33:29,863 INFO L226 Difference]: Without dead ends: 887 [2021-02-24 00:33:29,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2021-02-24 00:33:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-02-24 00:33:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 485. [2021-02-24 00:33:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2021-02-24 00:33:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 605 transitions. [2021-02-24 00:33:30,037 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 605 transitions. Word has length 135 [2021-02-24 00:33:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:30,038 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 605 transitions. [2021-02-24 00:33:30,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:33:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 605 transitions. [2021-02-24 00:33:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-02-24 00:33:30,041 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:30,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:30,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 00:33:30,042 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2002287986, now seen corresponding path program 1 times [2021-02-24 00:33:30,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:30,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457811827] [2021-02-24 00:33:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,077 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:30,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,151 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,151 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,166 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:30,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,171 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,171 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,204 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:30,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,246 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,254 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,255 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,259 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,263 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,270 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:30,274 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:30,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:33:30,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457811827] [2021-02-24 00:33:30,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:30,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-24 00:33:30,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668837628] [2021-02-24 00:33:30,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:33:30,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:33:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:33:30,313 INFO L87 Difference]: Start difference. First operand 485 states and 605 transitions. Second operand 8 states. [2021-02-24 00:33:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:32,325 INFO L93 Difference]: Finished difference Result 1199 states and 1564 transitions. [2021-02-24 00:33:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-02-24 00:33:32,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2021-02-24 00:33:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:32,332 INFO L225 Difference]: With dead ends: 1199 [2021-02-24 00:33:32,332 INFO L226 Difference]: Without dead ends: 765 [2021-02-24 00:33:32,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-02-24 00:33:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-02-24 00:33:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 474. [2021-02-24 00:33:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2021-02-24 00:33:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 588 transitions. [2021-02-24 00:33:32,484 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 588 transitions. Word has length 136 [2021-02-24 00:33:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:32,485 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 588 transitions. [2021-02-24 00:33:32,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:33:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 588 transitions. [2021-02-24 00:33:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-02-24 00:33:32,487 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:32,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:32,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 00:33:32,488 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash 617153439, now seen corresponding path program 1 times [2021-02-24 00:33:32,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:32,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577021453] [2021-02-24 00:33:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,536 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:32,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:32,541 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,542 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:32,542 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,543 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,615 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,628 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,628 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,631 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,631 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,646 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:32,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,668 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,679 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:32,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,692 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,695 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,696 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,709 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:33:32,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577021453] [2021-02-24 00:33:32,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:32,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-24 00:33:32,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641356248] [2021-02-24 00:33:32,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:33:32,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:33:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:33:32,739 INFO L87 Difference]: Start difference. First operand 474 states and 588 transitions. Second operand 8 states. [2021-02-24 00:33:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:36,627 INFO L93 Difference]: Finished difference Result 2153 states and 3097 transitions. [2021-02-24 00:33:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-24 00:33:36,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2021-02-24 00:33:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:36,645 INFO L225 Difference]: With dead ends: 2153 [2021-02-24 00:33:36,645 INFO L226 Difference]: Without dead ends: 1731 [2021-02-24 00:33:36,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2021-02-24 00:33:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2021-02-24 00:33:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 932. [2021-02-24 00:33:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2021-02-24 00:33:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1197 transitions. [2021-02-24 00:33:36,995 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1197 transitions. Word has length 140 [2021-02-24 00:33:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:36,997 INFO L480 AbstractCegarLoop]: Abstraction has 932 states and 1197 transitions. [2021-02-24 00:33:36,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:33:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1197 transitions. [2021-02-24 00:33:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-02-24 00:33:37,000 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:37,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:37,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 00:33:37,000 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1938792689, now seen corresponding path program 1 times [2021-02-24 00:33:37,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:37,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401851909] [2021-02-24 00:33:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:37,080 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:37,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,082 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:37,082 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,083 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:37,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:37,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,174 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,176 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:37,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,215 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,215 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,244 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,244 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,247 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,250 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,250 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,253 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,253 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,259 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:37,263 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:37,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:33:37,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1401851909] [2021-02-24 00:33:37,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:37,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-24 00:33:37,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667709056] [2021-02-24 00:33:37,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-24 00:33:37,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-24 00:33:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-02-24 00:33:37,289 INFO L87 Difference]: Start difference. First operand 932 states and 1197 transitions. Second operand 7 states. [2021-02-24 00:33:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:40,389 INFO L93 Difference]: Finished difference Result 3775 states and 5418 transitions. [2021-02-24 00:33:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-24 00:33:40,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2021-02-24 00:33:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:40,413 INFO L225 Difference]: With dead ends: 3775 [2021-02-24 00:33:40,413 INFO L226 Difference]: Without dead ends: 2894 [2021-02-24 00:33:40,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:33:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2021-02-24 00:33:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1861. [2021-02-24 00:33:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1861 states. [2021-02-24 00:33:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2432 transitions. [2021-02-24 00:33:40,948 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2432 transitions. Word has length 145 [2021-02-24 00:33:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:40,949 INFO L480 AbstractCegarLoop]: Abstraction has 1861 states and 2432 transitions. [2021-02-24 00:33:40,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-24 00:33:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2432 transitions. [2021-02-24 00:33:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-02-24 00:33:40,953 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:40,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:40,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 00:33:40,954 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:40,955 INFO L82 PathProgramCache]: Analyzing trace with hash -769560739, now seen corresponding path program 1 times [2021-02-24 00:33:40,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:40,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355762483] [2021-02-24 00:33:40,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:41,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,018 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:41,018 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:41,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,020 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,020 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:41,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,025 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:41,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,125 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,145 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,165 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,166 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,173 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,178 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,186 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,186 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,189 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-02-24 00:33:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:41,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:33:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:41,223 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:41,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-02-24 00:33:41,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355762483] [2021-02-24 00:33:41,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:41,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-24 00:33:41,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976777473] [2021-02-24 00:33:41,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-24 00:33:41,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-24 00:33:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-02-24 00:33:41,264 INFO L87 Difference]: Start difference. First operand 1861 states and 2432 transitions. Second operand 10 states. [2021-02-24 00:33:41,790 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-02-24 00:33:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:53,608 INFO L93 Difference]: Finished difference Result 18400 states and 29506 transitions. [2021-02-24 00:33:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-02-24 00:33:53,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2021-02-24 00:33:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:53,745 INFO L225 Difference]: With dead ends: 18400 [2021-02-24 00:33:53,745 INFO L226 Difference]: Without dead ends: 16589 [2021-02-24 00:33:53,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=709, Invalid=2153, Unknown=0, NotChecked=0, Total=2862 [2021-02-24 00:33:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16589 states. [2021-02-24 00:33:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16589 to 12338. [2021-02-24 00:33:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12338 states. [2021-02-24 00:33:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12338 states to 12338 states and 18075 transitions. [2021-02-24 00:33:57,433 INFO L78 Accepts]: Start accepts. Automaton has 12338 states and 18075 transitions. Word has length 183 [2021-02-24 00:33:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:57,434 INFO L480 AbstractCegarLoop]: Abstraction has 12338 states and 18075 transitions. [2021-02-24 00:33:57,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-24 00:33:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12338 states and 18075 transitions. [2021-02-24 00:33:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-02-24 00:33:57,457 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:57,458 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:57,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 00:33:57,458 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:57,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash -928957075, now seen corresponding path program 1 times [2021-02-24 00:33:57,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:57,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1176537582] [2021-02-24 00:33:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,520 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,521 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:57,524 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:57,525 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:57,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:57,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:57,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:33:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,631 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,634 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:33:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:33:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,684 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:33:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,700 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,701 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,706 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,712 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:33:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,727 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-02-24 00:33:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:33:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-02-24 00:33:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,795 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,799 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:57,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:57,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,861 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,868 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:57,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:33:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,880 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,881 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:57,882 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,882 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:57,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:57,888 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:57,889 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-02-24 00:33:58,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1176537582] [2021-02-24 00:33:58,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:58,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-24 00:33:58,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605377679] [2021-02-24 00:33:58,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:33:58,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:33:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:33:58,046 INFO L87 Difference]: Start difference. First operand 12338 states and 18075 transitions. Second operand 11 states. [2021-02-24 00:34:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:09,262 INFO L93 Difference]: Finished difference Result 35924 states and 59703 transitions. [2021-02-24 00:34:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-02-24 00:34:09,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2021-02-24 00:34:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:09,408 INFO L225 Difference]: With dead ends: 35924 [2021-02-24 00:34:09,409 INFO L226 Difference]: Without dead ends: 23641 [2021-02-24 00:34:09,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2021-02-24 00:34:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23641 states. [2021-02-24 00:34:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23641 to 18948. [2021-02-24 00:34:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2021-02-24 00:34:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 27319 transitions. [2021-02-24 00:34:14,632 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 27319 transitions. Word has length 237 [2021-02-24 00:34:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:14,633 INFO L480 AbstractCegarLoop]: Abstraction has 18948 states and 27319 transitions. [2021-02-24 00:34:14,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:34:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 27319 transitions. [2021-02-24 00:34:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-02-24 00:34:14,659 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:14,660 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:34:14,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 00:34:14,660 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash -39399650, now seen corresponding path program 1 times [2021-02-24 00:34:14,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:14,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333826391] [2021-02-24 00:34:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,706 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,707 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:14,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:34:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,793 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:34:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:34:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:34:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,836 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,838 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,839 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,843 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,843 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:34:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,847 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,848 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:34:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,852 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-02-24 00:34:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:14,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:34:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-02-24 00:34:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,907 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,914 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,925 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,926 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,942 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,942 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:14,972 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-24 00:34:14,973 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-24 00:34:14,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,989 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:14,995 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:14,996 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:14,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,003 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:15,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-02-24 00:34:15,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333826391] [2021-02-24 00:34:15,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:34:15,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-24 00:34:15,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030410399] [2021-02-24 00:34:15,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-24 00:34:15,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-24 00:34:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-02-24 00:34:15,244 INFO L87 Difference]: Start difference. First operand 18948 states and 27319 transitions. Second operand 13 states. [2021-02-24 00:34:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:27,016 INFO L93 Difference]: Finished difference Result 39958 states and 61868 transitions. [2021-02-24 00:34:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-02-24 00:34:27,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 237 [2021-02-24 00:34:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:27,123 INFO L225 Difference]: With dead ends: 39958 [2021-02-24 00:34:27,123 INFO L226 Difference]: Without dead ends: 16784 [2021-02-24 00:34:27,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=587, Invalid=1669, Unknown=0, NotChecked=0, Total=2256 [2021-02-24 00:34:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16784 states. [2021-02-24 00:34:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16784 to 12680. [2021-02-24 00:34:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12680 states. [2021-02-24 00:34:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12680 states to 12680 states and 17334 transitions. [2021-02-24 00:34:30,841 INFO L78 Accepts]: Start accepts. Automaton has 12680 states and 17334 transitions. Word has length 237 [2021-02-24 00:34:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:30,842 INFO L480 AbstractCegarLoop]: Abstraction has 12680 states and 17334 transitions. [2021-02-24 00:34:30,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-24 00:34:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 12680 states and 17334 transitions. [2021-02-24 00:34:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-02-24 00:34:30,857 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:30,858 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:34:30,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 00:34:30,858 INFO L428 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:30,859 INFO L82 PathProgramCache]: Analyzing trace with hash -432195166, now seen corresponding path program 1 times [2021-02-24 00:34:30,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:30,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1572169221] [2021-02-24 00:34:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:30,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:30,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,915 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:30,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:30,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:30,918 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:30,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,924 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:30,924 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:30,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,170 WARN L202 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-02-24 00:34:31,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,181 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,182 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:31,190 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:31,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:34:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,204 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,205 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,208 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:34:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,227 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:34:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,251 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,252 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:31,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:34:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,272 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,274 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,278 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:34:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:31,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:34:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,306 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,307 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-02-24 00:34:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,326 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,327 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:34:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,330 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,331 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-02-24 00:34:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,360 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,361 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:31,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,377 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:31,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:31,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,391 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:31,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,395 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:31,395 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:31,396 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-02-24 00:34:31,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1572169221] [2021-02-24 00:34:31,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:34:31,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-24 00:34:31,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869140859] [2021-02-24 00:34:31,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-24 00:34:31,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:31,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-24 00:34:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-24 00:34:31,478 INFO L87 Difference]: Start difference. First operand 12680 states and 17334 transitions. Second operand 13 states. [2021-02-24 00:34:31,804 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2021-02-24 00:34:37,498 WARN L202 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-02-24 00:34:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:47,299 INFO L93 Difference]: Finished difference Result 42936 states and 64315 transitions. [2021-02-24 00:34:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-02-24 00:34:47,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2021-02-24 00:34:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:47,492 INFO L225 Difference]: With dead ends: 42936 [2021-02-24 00:34:47,492 INFO L226 Difference]: Without dead ends: 30305 [2021-02-24 00:34:47,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1191, Invalid=5781, Unknown=0, NotChecked=0, Total=6972 [2021-02-24 00:34:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30305 states. [2021-02-24 00:34:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30305 to 21244. [2021-02-24 00:34:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21244 states. [2021-02-24 00:34:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21244 states to 21244 states and 27655 transitions. [2021-02-24 00:34:52,947 INFO L78 Accepts]: Start accepts. Automaton has 21244 states and 27655 transitions. Word has length 238 [2021-02-24 00:34:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:52,948 INFO L480 AbstractCegarLoop]: Abstraction has 21244 states and 27655 transitions. [2021-02-24 00:34:52,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-24 00:34:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21244 states and 27655 transitions. [2021-02-24 00:34:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-02-24 00:34:52,957 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:52,958 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:34:52,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-24 00:34:52,958 INFO L428 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash -44682101, now seen corresponding path program 1 times [2021-02-24 00:34:52,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:52,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113195458] [2021-02-24 00:34:52,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:52,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:52,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:53,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:53,003 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:53,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:53,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:53,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:34:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,102 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,105 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:34:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,120 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,121 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:34:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,139 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:34:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,143 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,144 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,150 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,152 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:34:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:34:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,157 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-02-24 00:34:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,178 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,179 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,180 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:53,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:34:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-02-24 00:34:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,212 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-02-24 00:34:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,228 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,228 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,233 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,233 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:34:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,235 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,237 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,237 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-24 00:34:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:53,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:53,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-02-24 00:34:53,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113195458] [2021-02-24 00:34:53,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:34:53,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-02-24 00:34:53,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513006177] [2021-02-24 00:34:53,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:34:53,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:53,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:34:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:34:53,472 INFO L87 Difference]: Start difference. First operand 21244 states and 27655 transitions. Second operand 11 states. [2021-02-24 00:35:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:35:06,911 INFO L93 Difference]: Finished difference Result 42816 states and 57374 transitions. [2021-02-24 00:35:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-02-24 00:35:06,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2021-02-24 00:35:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:35:07,054 INFO L225 Difference]: With dead ends: 42816 [2021-02-24 00:35:07,054 INFO L226 Difference]: Without dead ends: 28272 [2021-02-24 00:35:07,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=872, Invalid=2910, Unknown=0, NotChecked=0, Total=3782 [2021-02-24 00:35:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28272 states. [2021-02-24 00:35:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28272 to 21890. [2021-02-24 00:35:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21890 states. [2021-02-24 00:35:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21890 states to 21890 states and 27763 transitions. [2021-02-24 00:35:12,745 INFO L78 Accepts]: Start accepts. Automaton has 21890 states and 27763 transitions. Word has length 247 [2021-02-24 00:35:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:35:12,746 INFO L480 AbstractCegarLoop]: Abstraction has 21890 states and 27763 transitions. [2021-02-24 00:35:12,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:35:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21890 states and 27763 transitions. [2021-02-24 00:35:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2021-02-24 00:35:12,762 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:35:12,763 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:35:12,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-24 00:35:12,763 INFO L428 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:35:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:35:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -15200214, now seen corresponding path program 1 times [2021-02-24 00:35:12,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:35:12,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1606575918] [2021-02-24 00:35:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:35:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,809 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,810 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:35:12,816 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,817 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:35:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:35:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,897 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,897 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:35:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,899 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-24 00:35:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-02-24 00:35:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,930 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,930 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-24 00:35:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,934 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:35:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:35:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,939 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:35:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,941 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-02-24 00:35:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,944 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,945 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:35:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,947 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-02-24 00:35:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:35:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,979 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,980 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:12,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-02-24 00:35:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:12,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:12,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-02-24 00:35:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,008 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,009 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:35:13,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:35:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:35:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:35:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,021 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:35:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,024 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-02-24 00:35:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,026 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-02-24 00:35:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,039 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:35:13,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,046 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:35:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,054 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:35:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,062 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:35:13,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:35:13,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:35:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:35:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:35:13,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:35:13,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-24 00:35:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:35:13,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:35:13,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:35:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-02-24 00:35:13,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1606575918] [2021-02-24 00:35:13,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:35:13,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-24 00:35:13,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639859071] [2021-02-24 00:35:13,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-24 00:35:13,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:35:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-24 00:35:13,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-02-24 00:35:13,198 INFO L87 Difference]: Start difference. First operand 21890 states and 27763 transitions. Second operand 15 states. [2021-02-24 00:35:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:35:36,711 INFO L93 Difference]: Finished difference Result 68101 states and 89331 transitions. [2021-02-24 00:35:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-02-24 00:35:36,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2021-02-24 00:35:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:35:37,096 INFO L225 Difference]: With dead ends: 68101 [2021-02-24 00:35:37,097 INFO L226 Difference]: Without dead ends: 46262 [2021-02-24 00:35:37,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1348, Invalid=4658, Unknown=0, NotChecked=0, Total=6006 [2021-02-24 00:35:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46262 states. [2021-02-24 00:35:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46262 to 35689. [2021-02-24 00:35:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35689 states. [2021-02-24 00:35:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35689 states to 35689 states and 43780 transitions. [2021-02-24 00:35:46,410 INFO L78 Accepts]: Start accepts. Automaton has 35689 states and 43780 transitions. Word has length 303 [2021-02-24 00:35:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:35:46,411 INFO L480 AbstractCegarLoop]: Abstraction has 35689 states and 43780 transitions. [2021-02-24 00:35:46,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-24 00:35:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35689 states and 43780 transitions. [2021-02-24 00:35:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2021-02-24 00:35:46,430 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:35:46,431 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:35:46,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-24 00:35:46,431 INFO L428 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:35:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:35:46,432 INFO L82 PathProgramCache]: Analyzing trace with hash 170053481, now seen corresponding path program 1 times [2021-02-24 00:35:46,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:35:46,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149994088] [2021-02-24 00:35:46,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:35:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-24 00:35:46,469 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-24 00:35:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-24 00:35:46,496 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-24 00:35:46,721 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2021-02-24 00:35:46,722 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-02-24 00:35:46,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-24 00:35:46,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:35:46 BoogieIcfgContainer [2021-02-24 00:35:46,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 00:35:46,974 INFO L168 Benchmark]: Toolchain (without parser) took 145814.21 ms. Allocated memory was 152.0 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 128.3 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-02-24 00:35:46,974 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 152.0 MB. Free memory was 125.8 MB in the beginning and 125.8 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 00:35:46,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.39 ms. Allocated memory is still 152.0 MB. Free memory was 127.1 MB in the beginning and 113.7 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-02-24 00:35:46,974 INFO L168 Benchmark]: Boogie Preprocessor took 52.99 ms. Allocated memory is still 152.0 MB. Free memory was 113.7 MB in the beginning and 111.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 00:35:46,975 INFO L168 Benchmark]: RCFGBuilder took 1003.13 ms. Allocated memory is still 152.0 MB. Free memory was 111.5 MB in the beginning and 99.7 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-02-24 00:35:46,975 INFO L168 Benchmark]: TraceAbstraction took 144369.87 ms. Allocated memory was 152.0 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 99.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-02-24 00:35:46,976 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.25 ms. Allocated memory is still 152.0 MB. Free memory was 125.8 MB in the beginning and 125.8 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 367.39 ms. Allocated memory is still 152.0 MB. Free memory was 127.1 MB in the beginning and 113.7 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 52.99 ms. Allocated memory is still 152.0 MB. Free memory was 113.7 MB in the beginning and 111.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1003.13 ms. Allocated memory is still 152.0 MB. Free memory was 111.5 MB in the beginning and 99.7 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 144369.87 ms. Allocated memory was 152.0 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 99.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; 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=70, E_2=53, M_E=67, m_i=54, m_pc=0, m_st=60, T1_E=50, t1_i=68, t1_pc=57, t1_st=51, T2_E=65, t2_i=55, t2_pc=56, t2_st=59] [L18] int t1_pc = 0; 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=70, E_2=53, M_E=67, m_i=54, m_pc=0, m_st=60, T1_E=50, t1_i=68, t1_pc=0, t1_st=51, T2_E=65, t2_i=55, t2_pc=56, t2_st=59] [L19] int t2_pc = 0; 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=70, E_2=53, M_E=67, m_i=54, m_pc=0, m_st=60, T1_E=50, t1_i=68, t1_pc=0, t1_st=51, T2_E=65, t2_i=55, t2_pc=0, t2_st=59] [L20] int m_st ; 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=70, E_2=53, M_E=67, m_i=54, m_pc=0, m_st=0, T1_E=50, t1_i=68, t1_pc=0, t1_st=51, T2_E=65, t2_i=55, t2_pc=0, t2_st=59] [L21] int t1_st ; 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=70, E_2=53, M_E=67, m_i=54, m_pc=0, m_st=0, T1_E=50, t1_i=68, t1_pc=0, t1_st=0, T2_E=65, t2_i=55, t2_pc=0, t2_st=59] [L22] int t2_st ; 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=70, E_2=53, M_E=67, m_i=54, m_pc=0, m_st=0, T1_E=50, t1_i=68, t1_pc=0, t1_st=0, T2_E=65, t2_i=55, t2_pc=0, t2_st=0] [L23] int m_i ; 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=70, E_2=53, M_E=67, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=68, t1_pc=0, t1_st=0, T2_E=65, t2_i=55, t2_pc=0, t2_st=0] [L24] int t1_i ; 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=70, E_2=53, M_E=67, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, T2_E=65, t2_i=55, t2_pc=0, t2_st=0] [L25] int t2_i ; 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=70, E_2=53, M_E=67, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, T2_E=65, t2_i=0, t2_pc=0, t2_st=0] [L26] int M_E = 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=70, E_2=53, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, T2_E=65, t2_i=0, t2_pc=0, t2_st=0] [L27] int T1_E = 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=70, E_2=53, 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=65, t2_i=0, t2_pc=0, t2_st=0] [L28] int T2_E = 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=70, E_2=53, 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] [L29] int E_1 = 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=53, 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] [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 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=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L480] t1_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=0, t2_pc=0, t2_st=0] [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 ; 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] [L507] 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] [L508] int 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] [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 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] [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 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] [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 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] [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 ; 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] [L390] int 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] [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() 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, tmp=0] [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() 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, tmp___0=0] [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() 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, tmp___1=0] [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 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] [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() 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, tmp=1] [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 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] [L274] int 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] [L275] tmp_ndt_1 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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] [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 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] [L288] int tmp_ndt_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)=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] [L289] tmp_ndt_2 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L290] COND TRUE \read(tmp_ndt_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)=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, tmp_ndt_2=1] [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 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=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [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 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] [L302] int tmp_ndt_3; 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] [L303] tmp_ndt_3 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L304] COND TRUE \read(tmp_ndt_3) 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, tmp_ndt_3=1] [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=1] [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 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=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=1] [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=1] [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 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] [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=1] [L266] tmp = 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=1] [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=1] [L273] COND TRUE 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=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=1] [L274] int 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=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_2=1, tmp_ndt_3=1] [L275] tmp_ndt_1 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L276] COND TRUE \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=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=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=1] [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 ; 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] [L390] int 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)=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] [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() 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, tmp=0] [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 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] [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() 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, tmp___0=1] [L405] COND TRUE \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)=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, tmp___0=1] [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() 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, tmp___1=0] [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 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=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] [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=1] [L287] COND TRUE 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=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=1] [L288] int tmp_ndt_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)=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_3=1] [L289] tmp_ndt_2 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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=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=1] [L290] COND TRUE \read(tmp_ndt_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)=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=1] [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=1, tmp_ndt_3=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)=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 ; 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] [L390] int 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] [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() 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, tmp=0] [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() 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, tmp___0=0] [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 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] [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() 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, tmp___1=1] [L413] COND TRUE \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)=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, tmp___1=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 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] [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=1, tmp_ndt_3=1] [L301] COND TRUE 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=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=1, tmp_ndt_3=1] [L302] int tmp_ndt_3; 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=1] [L303] tmp_ndt_3 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L304] COND TRUE \read(tmp_ndt_3) 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=1, tmp_ndt_3=1] [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=1, tmp_ndt_3=1] [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] 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, 269 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 144.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 105.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3974 SDtfs, 28021 SDslu, 1850 SDs, 0 SdLazy, 27520 SolverSat, 9511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 524 SyntacticMatches, 1 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7804 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35689occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 41737 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1021490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 476/478 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...