/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 02:15:25,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 02:15:25,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 02:15:25,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 02:15:25,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 02:15:25,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 02:15:25,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 02:15:25,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 02:15:25,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 02:15:25,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 02:15:25,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 02:15:25,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 02:15:25,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 02:15:25,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 02:15:25,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 02:15:25,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 02:15:25,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 02:15:25,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 02:15:25,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 02:15:25,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 02:15:25,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 02:15:25,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 02:15:25,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 02:15:25,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 02:15:25,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 02:15:25,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 02:15:25,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 02:15:25,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 02:15:25,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 02:15:25,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 02:15:25,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 02:15:25,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 02:15:25,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 02:15:25,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 02:15:25,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 02:15:25,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 02:15:25,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 02:15:25,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 02:15:25,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 02:15:25,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 02:15:25,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 02:15:25,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 02:15:25,636 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 02:15:25,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 02:15:25,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 02:15:25,642 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 02:15:25,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 02:15:25,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 02:15:25,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 02:15:25,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 02:15:25,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 02:15:25,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 02:15:25,645 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 02:15:25,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 02:15:25,646 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 02:15:25,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 02:15:25,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 02:15:25,647 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 02:15:25,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 02:15:25,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 02:15:25,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 02:15:25,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 02:15:25,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 02:15:25,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 02:15:25,649 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 [2020-11-07 02:15:26,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 02:15:26,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 02:15:26,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 02:15:26,212 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 02:15:26,212 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 02:15:26,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-11-07 02:15:26,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df37ad97/65c939a3ea9d40569553a48898b6c11d/FLAGd9965dc42 [2020-11-07 02:15:26,935 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 02:15:26,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-11-07 02:15:26,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df37ad97/65c939a3ea9d40569553a48898b6c11d/FLAGd9965dc42 [2020-11-07 02:15:27,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df37ad97/65c939a3ea9d40569553a48898b6c11d [2020-11-07 02:15:27,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 02:15:27,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 02:15:27,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 02:15:27,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 02:15:27,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 02:15:27,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e4ae97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27, skipping insertion in model container [2020-11-07 02:15:27,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 02:15:27,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 02:15:27,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 02:15:27,623 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 02:15:27,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 02:15:27,739 INFO L208 MainTranslator]: Completed translation [2020-11-07 02:15:27,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27 WrapperNode [2020-11-07 02:15:27,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 02:15:27,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 02:15:27,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 02:15:27,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 02:15:27,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... [2020-11-07 02:15:27,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 02:15:27,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 02:15:27,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 02:15:27,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 02:15:27,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 02:15:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 02:15:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 02:15:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 02:15:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-07 02:15:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-07 02:15:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-07 02:15:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-07 02:15:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-07 02:15:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-07 02:15:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-07 02:15:27,913 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-07 02:15:27,913 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-07 02:15:27,913 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-07 02:15:27,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-07 02:15:27,913 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-07 02:15:27,913 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-07 02:15:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-07 02:15:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-07 02:15:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-07 02:15:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-07 02:15:27,916 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-07 02:15:27,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 02:15:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 02:15:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 02:15:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 02:15:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 02:15:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-07 02:15:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-07 02:15:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-07 02:15:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-07 02:15:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 02:15:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-07 02:15:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-07 02:15:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-07 02:15:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-07 02:15:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-07 02:15:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-07 02:15:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-07 02:15:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-07 02:15:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-07 02:15:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-07 02:15:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-07 02:15:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-07 02:15:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-07 02:15:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-07 02:15:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 02:15:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 02:15:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 02:15:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 02:15:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 02:15:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 02:15:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 02:15:28,841 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 02:15:28,841 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-07 02:15:28,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:15:28 BoogieIcfgContainer [2020-11-07 02:15:28,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 02:15:28,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 02:15:28,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 02:15:28,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 02:15:28,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:15:27" (1/3) ... [2020-11-07 02:15:28,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a86b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:15:28, skipping insertion in model container [2020-11-07 02:15:28,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:27" (2/3) ... [2020-11-07 02:15:28,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a86b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:15:28, skipping insertion in model container [2020-11-07 02:15:28,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:15:28" (3/3) ... [2020-11-07 02:15:28,857 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-11-07 02:15:28,871 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 02:15:28,874 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 02:15:28,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 02:15:28,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 02:15:28,911 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 02:15:28,911 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 02:15:28,911 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 02:15:28,911 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 02:15:28,912 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 02:15:28,912 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 02:15:28,912 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 02:15:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-11-07 02:15:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-07 02:15:28,950 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:28,952 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] [2020-11-07 02:15:28,952 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1506744400, now seen corresponding path program 1 times [2020-11-07 02:15:28,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:28,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914518172] [2020-11-07 02:15:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:29,051 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 02:15:29,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914518172] [2020-11-07 02:15:29,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:29,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 02:15:29,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107313341] [2020-11-07 02:15:29,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 02:15:29,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 02:15:29,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-07 02:15:29,848 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 7 states. [2020-11-07 02:15:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:15:32,453 INFO L93 Difference]: Finished difference Result 786 states and 1048 transitions. [2020-11-07 02:15:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 02:15:32,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2020-11-07 02:15:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:15:32,492 INFO L225 Difference]: With dead ends: 786 [2020-11-07 02:15:32,492 INFO L226 Difference]: Without dead ends: 581 [2020-11-07 02:15:32,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-11-07 02:15:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-11-07 02:15:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 400. [2020-11-07 02:15:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-11-07 02:15:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 484 transitions. [2020-11-07 02:15:32,713 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 484 transitions. Word has length 116 [2020-11-07 02:15:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:15:32,714 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 484 transitions. [2020-11-07 02:15:32,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 02:15:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 484 transitions. [2020-11-07 02:15:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 02:15:32,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:32,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:15:32,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 02:15:32,721 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash -471057246, now seen corresponding path program 1 times [2020-11-07 02:15:32,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:32,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410641809] [2020-11-07 02:15:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:32,726 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:32,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 02:15:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:33,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:15:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:33,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:33,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:33,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:33,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 02:15:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 02:15:33,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410641809] [2020-11-07 02:15:33,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:33,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 02:15:33,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557616237] [2020-11-07 02:15:33,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 02:15:33,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 02:15:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-07 02:15:33,226 INFO L87 Difference]: Start difference. First operand 400 states and 484 transitions. Second operand 10 states. [2020-11-07 02:15:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:15:37,067 INFO L93 Difference]: Finished difference Result 1537 states and 2105 transitions. [2020-11-07 02:15:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 02:15:37,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2020-11-07 02:15:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:15:37,091 INFO L225 Difference]: With dead ends: 1537 [2020-11-07 02:15:37,091 INFO L226 Difference]: Without dead ends: 1185 [2020-11-07 02:15:37,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2020-11-07 02:15:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-11-07 02:15:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 763. [2020-11-07 02:15:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2020-11-07 02:15:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 961 transitions. [2020-11-07 02:15:37,297 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 961 transitions. Word has length 179 [2020-11-07 02:15:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:15:37,299 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 961 transitions. [2020-11-07 02:15:37,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 02:15:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 961 transitions. [2020-11-07 02:15:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 02:15:37,304 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:37,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:15:37,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 02:15:37,305 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1422926590, now seen corresponding path program 1 times [2020-11-07 02:15:37,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:37,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570945263] [2020-11-07 02:15:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:37,310 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 02:15:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:15:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 02:15:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 02:15:37,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [570945263] [2020-11-07 02:15:37,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:37,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 02:15:37,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773026696] [2020-11-07 02:15:37,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 02:15:37,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 02:15:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-07 02:15:37,583 INFO L87 Difference]: Start difference. First operand 763 states and 961 transitions. Second operand 9 states. [2020-11-07 02:15:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:15:40,099 INFO L93 Difference]: Finished difference Result 1788 states and 2319 transitions. [2020-11-07 02:15:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 02:15:40,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2020-11-07 02:15:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:15:40,114 INFO L225 Difference]: With dead ends: 1788 [2020-11-07 02:15:40,114 INFO L226 Difference]: Without dead ends: 1071 [2020-11-07 02:15:40,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-11-07 02:15:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-11-07 02:15:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 757. [2020-11-07 02:15:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2020-11-07 02:15:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 950 transitions. [2020-11-07 02:15:40,307 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 950 transitions. Word has length 179 [2020-11-07 02:15:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:15:40,312 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 950 transitions. [2020-11-07 02:15:40,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 02:15:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 950 transitions. [2020-11-07 02:15:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 02:15:40,323 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:40,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:15:40,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 02:15:40,324 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1075147907, now seen corresponding path program 1 times [2020-11-07 02:15:40,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:40,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876952974] [2020-11-07 02:15:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:40,331 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 02:15:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:15:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 02:15:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 02:15:40,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876952974] [2020-11-07 02:15:40,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:40,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 02:15:40,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380277297] [2020-11-07 02:15:40,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 02:15:40,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 02:15:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 02:15:40,735 INFO L87 Difference]: Start difference. First operand 757 states and 950 transitions. Second operand 11 states. [2020-11-07 02:15:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:15:47,966 INFO L93 Difference]: Finished difference Result 4460 states and 6052 transitions. [2020-11-07 02:15:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 02:15:47,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-11-07 02:15:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:15:47,997 INFO L225 Difference]: With dead ends: 4460 [2020-11-07 02:15:47,997 INFO L226 Difference]: Without dead ends: 3748 [2020-11-07 02:15:48,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 02:15:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2020-11-07 02:15:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 2960. [2020-11-07 02:15:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2020-11-07 02:15:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3739 transitions. [2020-11-07 02:15:48,719 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3739 transitions. Word has length 184 [2020-11-07 02:15:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:15:48,720 INFO L481 AbstractCegarLoop]: Abstraction has 2960 states and 3739 transitions. [2020-11-07 02:15:48,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 02:15:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3739 transitions. [2020-11-07 02:15:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-11-07 02:15:48,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:48,728 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, 2, 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] [2020-11-07 02:15:48,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 02:15:48,729 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1695855478, now seen corresponding path program 1 times [2020-11-07 02:15:48,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:48,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198326849] [2020-11-07 02:15:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:48,733 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 02:15:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:15:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:48,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:15:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-11-07 02:15:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:15:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:15:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-11-07 02:15:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 02:15:49,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198326849] [2020-11-07 02:15:49,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:49,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 02:15:49,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616356262] [2020-11-07 02:15:49,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 02:15:49,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 02:15:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-07 02:15:49,182 INFO L87 Difference]: Start difference. First operand 2960 states and 3739 transitions. Second operand 12 states. [2020-11-07 02:15:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:15:52,726 INFO L93 Difference]: Finished difference Result 6449 states and 8415 transitions. [2020-11-07 02:15:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 02:15:52,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2020-11-07 02:15:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:15:52,752 INFO L225 Difference]: With dead ends: 6449 [2020-11-07 02:15:52,752 INFO L226 Difference]: Without dead ends: 3224 [2020-11-07 02:15:52,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2020-11-07 02:15:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2020-11-07 02:15:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2414. [2020-11-07 02:15:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2020-11-07 02:15:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2984 transitions. [2020-11-07 02:15:53,358 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2984 transitions. Word has length 228 [2020-11-07 02:15:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:15:53,359 INFO L481 AbstractCegarLoop]: Abstraction has 2414 states and 2984 transitions. [2020-11-07 02:15:53,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 02:15:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2984 transitions. [2020-11-07 02:15:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-11-07 02:15:53,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:53,365 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:15:53,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 02:15:53,365 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1709667110, now seen corresponding path program 1 times [2020-11-07 02:15:53,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:53,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [62274836] [2020-11-07 02:15:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:53,369 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 02:15:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:15:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 02:15:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:15:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:15:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-11-07 02:15:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 02:15:53,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [62274836] [2020-11-07 02:15:53,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:53,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 02:15:53,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900403601] [2020-11-07 02:15:53,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 02:15:53,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:53,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 02:15:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 02:15:53,722 INFO L87 Difference]: Start difference. First operand 2414 states and 2984 transitions. Second operand 11 states. [2020-11-07 02:15:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:15:58,249 INFO L93 Difference]: Finished difference Result 6907 states and 8962 transitions. [2020-11-07 02:15:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 02:15:58,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2020-11-07 02:15:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:15:58,279 INFO L225 Difference]: With dead ends: 6907 [2020-11-07 02:15:58,279 INFO L226 Difference]: Without dead ends: 4538 [2020-11-07 02:15:58,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2020-11-07 02:15:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2020-11-07 02:15:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 3624. [2020-11-07 02:15:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3624 states. [2020-11-07 02:15:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4394 transitions. [2020-11-07 02:15:59,024 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4394 transitions. Word has length 228 [2020-11-07 02:15:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:15:59,025 INFO L481 AbstractCegarLoop]: Abstraction has 3624 states and 4394 transitions. [2020-11-07 02:15:59,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 02:15:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4394 transitions. [2020-11-07 02:15:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-11-07 02:15:59,032 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:15:59,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:15:59,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 02:15:59,033 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:15:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:15:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash -730853257, now seen corresponding path program 1 times [2020-11-07 02:15:59,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:15:59,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036457837] [2020-11-07 02:15:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:15:59,037 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:15:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:15:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:15:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:15:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:15:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:15:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:15:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:15:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 02:15:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:15:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:15:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 02:15:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 02:15:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 02:15:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:15:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:15:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:15:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:15:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-11-07 02:15:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:15:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 02:15:59,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036457837] [2020-11-07 02:15:59,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:15:59,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 02:15:59,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881348242] [2020-11-07 02:15:59,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 02:15:59,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:15:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 02:15:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-07 02:15:59,458 INFO L87 Difference]: Start difference. First operand 3624 states and 4394 transitions. Second operand 12 states. [2020-11-07 02:16:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:07,341 INFO L93 Difference]: Finished difference Result 7013 states and 8631 transitions. [2020-11-07 02:16:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-11-07 02:16:07,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 257 [2020-11-07 02:16:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:07,368 INFO L225 Difference]: With dead ends: 7013 [2020-11-07 02:16:07,369 INFO L226 Difference]: Without dead ends: 4573 [2020-11-07 02:16:07,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2020-11-07 02:16:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2020-11-07 02:16:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3666. [2020-11-07 02:16:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2020-11-07 02:16:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4342 transitions. [2020-11-07 02:16:07,962 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4342 transitions. Word has length 257 [2020-11-07 02:16:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:07,962 INFO L481 AbstractCegarLoop]: Abstraction has 3666 states and 4342 transitions. [2020-11-07 02:16:07,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 02:16:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4342 transitions. [2020-11-07 02:16:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-07 02:16:07,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:07,972 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:16:07,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 02:16:07,973 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1731988670, now seen corresponding path program 1 times [2020-11-07 02:16:07,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:07,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014103939] [2020-11-07 02:16:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:07,976 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:16:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 02:16:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 02:16:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 02:16:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 02:16:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:16:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 02:16:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 02:16:08,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014103939] [2020-11-07 02:16:08,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:08,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 02:16:08,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273066652] [2020-11-07 02:16:08,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 02:16:08,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 02:16:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-11-07 02:16:08,483 INFO L87 Difference]: Start difference. First operand 3666 states and 4342 transitions. Second operand 17 states. [2020-11-07 02:16:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:19,325 INFO L93 Difference]: Finished difference Result 8415 states and 10549 transitions. [2020-11-07 02:16:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-11-07 02:16:19,326 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 263 [2020-11-07 02:16:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:19,363 INFO L225 Difference]: With dead ends: 8415 [2020-11-07 02:16:19,363 INFO L226 Difference]: Without dead ends: 4793 [2020-11-07 02:16:19,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2020-11-07 02:16:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2020-11-07 02:16:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 3674. [2020-11-07 02:16:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3674 states. [2020-11-07 02:16:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4249 transitions. [2020-11-07 02:16:20,161 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4249 transitions. Word has length 263 [2020-11-07 02:16:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:20,162 INFO L481 AbstractCegarLoop]: Abstraction has 3674 states and 4249 transitions. [2020-11-07 02:16:20,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 02:16:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4249 transitions. [2020-11-07 02:16:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-07 02:16:20,168 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:20,169 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:16:20,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 02:16:20,169 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -928461701, now seen corresponding path program 1 times [2020-11-07 02:16:20,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:20,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147297621] [2020-11-07 02:16:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:20,173 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 02:16:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 02:16:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 02:16:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 02:16:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 02:16:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:16:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 02:16:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 02:16:20,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147297621] [2020-11-07 02:16:20,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:20,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 02:16:20,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727611428] [2020-11-07 02:16:20,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 02:16:20,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:20,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 02:16:20,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-07 02:16:20,598 INFO L87 Difference]: Start difference. First operand 3674 states and 4249 transitions. Second operand 12 states. [2020-11-07 02:16:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:27,713 INFO L93 Difference]: Finished difference Result 10323 states and 12288 transitions. [2020-11-07 02:16:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-07 02:16:27,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 263 [2020-11-07 02:16:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:27,776 INFO L225 Difference]: With dead ends: 10323 [2020-11-07 02:16:27,777 INFO L226 Difference]: Without dead ends: 7591 [2020-11-07 02:16:27,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 02:16:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2020-11-07 02:16:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 6221. [2020-11-07 02:16:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-11-07 02:16:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 7326 transitions. [2020-11-07 02:16:29,472 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 7326 transitions. Word has length 263 [2020-11-07 02:16:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:29,473 INFO L481 AbstractCegarLoop]: Abstraction has 6221 states and 7326 transitions. [2020-11-07 02:16:29,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 02:16:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 7326 transitions. [2020-11-07 02:16:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-11-07 02:16:29,482 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:29,483 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:16:29,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 02:16:29,483 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1796451529, now seen corresponding path program 1 times [2020-11-07 02:16:29,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:29,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275687743] [2020-11-07 02:16:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:29,488 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:16:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 02:16:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 02:16:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 02:16:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-11-07 02:16:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-11-07 02:16:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-11-07 02:16:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2020-11-07 02:16:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-11-07 02:16:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2020-11-07 02:16:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 02:16:29,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275687743] [2020-11-07 02:16:29,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:29,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 02:16:29,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337544511] [2020-11-07 02:16:29,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 02:16:29,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 02:16:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-07 02:16:29,954 INFO L87 Difference]: Start difference. First operand 6221 states and 7326 transitions. Second operand 13 states. [2020-11-07 02:16:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:34,465 INFO L93 Difference]: Finished difference Result 10840 states and 12764 transitions. [2020-11-07 02:16:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 02:16:34,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2020-11-07 02:16:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:34,491 INFO L225 Difference]: With dead ends: 10840 [2020-11-07 02:16:34,491 INFO L226 Difference]: Without dead ends: 4665 [2020-11-07 02:16:34,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 02:16:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2020-11-07 02:16:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 3929. [2020-11-07 02:16:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2020-11-07 02:16:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 4552 transitions. [2020-11-07 02:16:35,276 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 4552 transitions. Word has length 284 [2020-11-07 02:16:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:35,277 INFO L481 AbstractCegarLoop]: Abstraction has 3929 states and 4552 transitions. [2020-11-07 02:16:35,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 02:16:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 4552 transitions. [2020-11-07 02:16:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2020-11-07 02:16:35,281 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:35,282 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:16:35,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 02:16:35,282 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:35,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash -3043505, now seen corresponding path program 1 times [2020-11-07 02:16:35,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:35,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1634840269] [2020-11-07 02:16:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:35,286 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:16:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 02:16:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 02:16:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 02:16:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 02:16:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 02:16:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 02:16:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2020-11-07 02:16:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-11-07 02:16:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 02:16:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2020-11-07 02:16:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 02:16:35,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1634840269] [2020-11-07 02:16:35,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:35,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 02:16:35,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789074427] [2020-11-07 02:16:35,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 02:16:35,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 02:16:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-07 02:16:35,823 INFO L87 Difference]: Start difference. First operand 3929 states and 4552 transitions. Second operand 16 states. [2020-11-07 02:16:36,228 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2020-11-07 02:16:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:43,218 INFO L93 Difference]: Finished difference Result 9855 states and 12115 transitions. [2020-11-07 02:16:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-11-07 02:16:43,219 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 293 [2020-11-07 02:16:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:43,249 INFO L225 Difference]: With dead ends: 9855 [2020-11-07 02:16:43,250 INFO L226 Difference]: Without dead ends: 5976 [2020-11-07 02:16:43,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=896, Invalid=3526, Unknown=0, NotChecked=0, Total=4422 [2020-11-07 02:16:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-11-07 02:16:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4920. [2020-11-07 02:16:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2020-11-07 02:16:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5549 transitions. [2020-11-07 02:16:44,375 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5549 transitions. Word has length 293 [2020-11-07 02:16:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:44,376 INFO L481 AbstractCegarLoop]: Abstraction has 4920 states and 5549 transitions. [2020-11-07 02:16:44,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 02:16:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5549 transitions. [2020-11-07 02:16:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2020-11-07 02:16:44,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:44,386 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:16:44,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 02:16:44,387 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 686538755, now seen corresponding path program 1 times [2020-11-07 02:16:44,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:44,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931034903] [2020-11-07 02:16:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:44,391 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:16:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 02:16:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-07 02:16:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 02:16:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:16:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 02:16:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-11-07 02:16:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2020-11-07 02:16:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2020-11-07 02:16:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2020-11-07 02:16:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2020-11-07 02:16:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-11-07 02:16:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-11-07 02:16:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2020-11-07 02:16:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:16:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2020-11-07 02:16:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 02:16:44,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931034903] [2020-11-07 02:16:44,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:44,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 02:16:44,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853392825] [2020-11-07 02:16:44,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 02:16:44,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 02:16:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-07 02:16:44,935 INFO L87 Difference]: Start difference. First operand 4920 states and 5549 transitions. Second operand 11 states. [2020-11-07 02:16:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:48,621 INFO L93 Difference]: Finished difference Result 9579 states and 11063 transitions. [2020-11-07 02:16:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 02:16:48,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 428 [2020-11-07 02:16:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:48,650 INFO L225 Difference]: With dead ends: 9579 [2020-11-07 02:16:48,650 INFO L226 Difference]: Without dead ends: 4879 [2020-11-07 02:16:48,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2020-11-07 02:16:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2020-11-07 02:16:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4498. [2020-11-07 02:16:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2020-11-07 02:16:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 5020 transitions. [2020-11-07 02:16:49,786 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 5020 transitions. Word has length 428 [2020-11-07 02:16:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:49,786 INFO L481 AbstractCegarLoop]: Abstraction has 4498 states and 5020 transitions. [2020-11-07 02:16:49,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 02:16:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 5020 transitions. [2020-11-07 02:16:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2020-11-07 02:16:49,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:49,796 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:16:49,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 02:16:49,797 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash -818266378, now seen corresponding path program 1 times [2020-11-07 02:16:49,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:49,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67756262] [2020-11-07 02:16:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:49,801 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:49,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:16:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 02:16:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-07 02:16:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 02:16:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:16:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:16:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-11-07 02:16:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2020-11-07 02:16:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2020-11-07 02:16:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2020-11-07 02:16:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:16:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2020-11-07 02:16:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2020-11-07 02:16:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2020-11-07 02:16:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2020-11-07 02:16:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2020-11-07 02:16:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 02:16:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2020-11-07 02:16:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 02:16:50,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67756262] [2020-11-07 02:16:50,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:50,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 02:16:50,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639408305] [2020-11-07 02:16:50,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 02:16:50,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:50,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 02:16:50,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-11-07 02:16:50,486 INFO L87 Difference]: Start difference. First operand 4498 states and 5020 transitions. Second operand 15 states. [2020-11-07 02:16:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:54,787 INFO L93 Difference]: Finished difference Result 6018 states and 6735 transitions. [2020-11-07 02:16:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 02:16:54,787 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 430 [2020-11-07 02:16:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:54,795 INFO L225 Difference]: With dead ends: 6018 [2020-11-07 02:16:54,796 INFO L226 Difference]: Without dead ends: 1790 [2020-11-07 02:16:54,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 02:16:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-11-07 02:16:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1588. [2020-11-07 02:16:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-11-07 02:16:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1723 transitions. [2020-11-07 02:16:55,125 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1723 transitions. Word has length 430 [2020-11-07 02:16:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:55,126 INFO L481 AbstractCegarLoop]: Abstraction has 1588 states and 1723 transitions. [2020-11-07 02:16:55,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 02:16:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1723 transitions. [2020-11-07 02:16:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2020-11-07 02:16:55,132 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:55,132 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-11-07 02:16:55,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 02:16:55,133 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1676985734, now seen corresponding path program 1 times [2020-11-07 02:16:55,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:55,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145754545] [2020-11-07 02:16:55,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:55,138 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:16:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 02:16:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 02:16:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 02:16:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 02:16:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 02:16:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 02:16:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:16:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 02:16:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 02:16:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 02:16:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-11-07 02:16:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:16:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 02:16:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-11-07 02:16:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2020-11-07 02:16:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2020-11-07 02:16:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2020-11-07 02:16:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2020-11-07 02:16:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2020-11-07 02:16:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2020-11-07 02:16:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2020-11-07 02:16:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2020-11-07 02:16:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-07 02:16:55,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145754545] [2020-11-07 02:16:55,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:55,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 02:16:55,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125391099] [2020-11-07 02:16:55,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 02:16:55,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:55,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 02:16:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-07 02:16:55,605 INFO L87 Difference]: Start difference. First operand 1588 states and 1723 transitions. Second operand 12 states. [2020-11-07 02:16:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:16:58,907 INFO L93 Difference]: Finished difference Result 2873 states and 3125 transitions. [2020-11-07 02:16:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 02:16:58,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 438 [2020-11-07 02:16:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:16:58,916 INFO L225 Difference]: With dead ends: 2873 [2020-11-07 02:16:58,916 INFO L226 Difference]: Without dead ends: 1555 [2020-11-07 02:16:58,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 02:16:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2020-11-07 02:16:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1452. [2020-11-07 02:16:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2020-11-07 02:16:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1559 transitions. [2020-11-07 02:16:59,248 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1559 transitions. Word has length 438 [2020-11-07 02:16:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:16:59,248 INFO L481 AbstractCegarLoop]: Abstraction has 1452 states and 1559 transitions. [2020-11-07 02:16:59,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 02:16:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1559 transitions. [2020-11-07 02:16:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2020-11-07 02:16:59,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:16:59,252 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-11-07 02:16:59,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 02:16:59,252 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:16:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:16:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash -318238593, now seen corresponding path program 1 times [2020-11-07 02:16:59,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:16:59,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [110700162] [2020-11-07 02:16:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:16:59,258 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:16:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:16:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:16:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:16:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:16:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:16:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:16:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:16:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 02:16:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:16:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:16:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:16:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 02:16:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 02:16:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 02:16:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 02:16:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 02:16:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:16:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 02:16:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 02:16:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 02:16:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-11-07 02:16:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:16:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 02:16:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-11-07 02:16:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2020-11-07 02:16:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2020-11-07 02:16:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2020-11-07 02:16:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-11-07 02:16:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:16:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-11-07 02:16:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2020-11-07 02:16:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2020-11-07 02:16:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:16:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2020-11-07 02:16:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:16:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-11-07 02:16:59,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [110700162] [2020-11-07 02:16:59,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:16:59,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 02:16:59,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069461663] [2020-11-07 02:16:59,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 02:16:59,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:16:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 02:16:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-11-07 02:16:59,792 INFO L87 Difference]: Start difference. First operand 1452 states and 1559 transitions. Second operand 14 states. [2020-11-07 02:17:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:17:02,559 INFO L93 Difference]: Finished difference Result 2747 states and 2968 transitions. [2020-11-07 02:17:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 02:17:02,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 439 [2020-11-07 02:17:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:17:02,566 INFO L225 Difference]: With dead ends: 2747 [2020-11-07 02:17:02,567 INFO L226 Difference]: Without dead ends: 1565 [2020-11-07 02:17:02,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2020-11-07 02:17:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2020-11-07 02:17:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1449. [2020-11-07 02:17:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2020-11-07 02:17:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1553 transitions. [2020-11-07 02:17:03,005 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1553 transitions. Word has length 439 [2020-11-07 02:17:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:17:03,006 INFO L481 AbstractCegarLoop]: Abstraction has 1449 states and 1553 transitions. [2020-11-07 02:17:03,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 02:17:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1553 transitions. [2020-11-07 02:17:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2020-11-07 02:17:03,011 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 02:17:03,012 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 02:17:03,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 02:17:03,012 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 02:17:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 02:17:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash 784629983, now seen corresponding path program 1 times [2020-11-07 02:17:03,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 02:17:03,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [940133633] [2020-11-07 02:17:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 02:17:03,017 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 02:17:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:17:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 02:17:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 02:17:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 02:17:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 02:17:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 02:17:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:17:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 02:17:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 02:17:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 02:17:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 02:17:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 02:17:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 02:17:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 02:17:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 02:17:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 02:17:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 02:17:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 02:17:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:17:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 02:17:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 02:17:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 02:17:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-11-07 02:17:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 02:17:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 02:17:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-11-07 02:17:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2020-11-07 02:17:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2020-11-07 02:17:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2020-11-07 02:17:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-11-07 02:17:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 02:17:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-11-07 02:17:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2020-11-07 02:17:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2020-11-07 02:17:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 02:17:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2020-11-07 02:17:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 02:17:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-07 02:17:03,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [940133633] [2020-11-07 02:17:03,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 02:17:03,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 02:17:03,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853900772] [2020-11-07 02:17:03,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 02:17:03,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 02:17:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 02:17:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-07 02:17:03,530 INFO L87 Difference]: Start difference. First operand 1449 states and 1553 transitions. Second operand 15 states. [2020-11-07 02:17:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 02:17:06,686 INFO L93 Difference]: Finished difference Result 2282 states and 2452 transitions. [2020-11-07 02:17:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 02:17:06,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 439 [2020-11-07 02:17:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 02:17:06,688 INFO L225 Difference]: With dead ends: 2282 [2020-11-07 02:17:06,689 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 02:17:06,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 02:17:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 02:17:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 02:17:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 02:17:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 02:17:06,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2020-11-07 02:17:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 02:17:06,693 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 02:17:06,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 02:17:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 02:17:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 02:17:06,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 02:17:06,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 02:17:07,786 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2020-11-07 02:17:08,036 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2020-11-07 02:17:08,831 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 114 [2020-11-07 02:17:09,208 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2020-11-07 02:17:09,459 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2020-11-07 02:17:09,605 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2020-11-07 02:17:09,728 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2020-11-07 02:17:10,650 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2020-11-07 02:17:10,820 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2020-11-07 02:17:16,266 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 105 [2020-11-07 02:17:16,461 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2020-11-07 02:17:16,594 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2020-11-07 02:17:21,121 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2020-11-07 02:17:21,421 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2020-11-07 02:17:21,634 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2020-11-07 02:17:23,486 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2020-11-07 02:17:23,787 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2020-11-07 02:17:23,998 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2020-11-07 02:17:24,371 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2020-11-07 02:17:24,491 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2020-11-07 02:17:24,672 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 117 [2020-11-07 02:17:24,780 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 119 [2020-11-07 02:17:24,978 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 121 [2020-11-07 02:17:25,802 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2020-11-07 02:17:28,763 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2020-11-07 02:17:29,436 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2020-11-07 02:17:31,958 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2020-11-07 02:17:32,383 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2020-11-07 02:17:35,986 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2020-11-07 02:17:36,098 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2020-11-07 02:17:36,213 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2020-11-07 02:17:36,327 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2020-11-07 02:17:36,567 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2020-11-07 02:17:36,678 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2020-11-07 02:17:37,254 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-11-07 02:17:37,385 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-11-07 02:17:37,520 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-11-07 02:17:37,679 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-11-07 02:17:38,000 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-11-07 02:17:38,144 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-11-07 02:17:40,191 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-11-07 02:17:40,341 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-11-07 02:17:40,477 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-11-07 02:17:40,635 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-11-07 02:17:40,960 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-11-07 02:17:41,103 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-11-07 02:17:46,600 WARN L194 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2020-11-07 02:17:46,859 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-11-07 02:17:48,209 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2020-11-07 02:17:49,573 WARN L194 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 154 DAG size of output: 76 [2020-11-07 02:17:50,596 WARN L194 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2020-11-07 02:17:51,398 WARN L194 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 55 [2020-11-07 02:17:52,560 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 162 DAG size of output: 89 [2020-11-07 02:17:52,812 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 36 [2020-11-07 02:17:54,812 WARN L194 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2020-11-07 02:17:56,843 WARN L194 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2020-11-07 02:17:57,057 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-11-07 02:17:58,035 WARN L194 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-11-07 02:17:58,640 WARN L194 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2020-11-07 02:17:58,784 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2020-11-07 02:17:59,057 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2020-11-07 02:18:00,809 WARN L194 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 125 DAG size of output: 67 [2020-11-07 02:18:00,923 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2020-11-07 02:18:02,706 WARN L194 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2020-11-07 02:18:03,161 WARN L194 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2020-11-07 02:18:03,830 WARN L194 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2020-11-07 02:18:04,076 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2020-11-07 02:18:04,346 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 38 [2020-11-07 02:18:04,795 WARN L194 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-11-07 02:18:04,993 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-11-07 02:18:05,223 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-11-07 02:18:05,361 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-11-07 02:18:05,471 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-11-07 02:18:05,706 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-11-07 02:18:05,838 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-11-07 02:18:06,074 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-11-07 02:18:06,297 WARN L194 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-11-07 02:18:06,526 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-11-07 02:18:07,674 WARN L194 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2020-11-07 02:18:08,081 WARN L194 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2020-11-07 02:18:08,184 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-11-07 02:18:08,852 WARN L194 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2020-11-07 02:18:08,968 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2020-11-07 02:18:09,609 WARN L194 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2020-11-07 02:18:10,128 WARN L194 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2020-11-07 02:18:10,508 WARN L194 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-11-07 02:18:10,739 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-11-07 02:18:11,807 WARN L194 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2020-11-07 02:18:13,024 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 127 DAG size of output: 69 [2020-11-07 02:18:13,507 WARN L194 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2020-11-07 02:18:14,266 WARN L194 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-11-07 02:18:16,203 WARN L194 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2020-11-07 02:18:17,045 WARN L194 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-11-07 02:18:17,562 WARN L194 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-11-07 02:18:18,158 WARN L194 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-11-07 02:18:18,379 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-11-07 02:18:19,021 WARN L194 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 43 [2020-11-07 02:18:19,487 WARN L194 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2020-11-07 02:18:19,717 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-11-07 02:18:19,950 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-11-07 02:18:20,350 WARN L194 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-11-07 02:18:20,582 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-11-07 02:18:21,248 WARN L194 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 43 [2020-11-07 02:18:23,245 WARN L194 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 170 DAG size of output: 90 [2020-11-07 02:18:24,590 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2020-11-07 02:18:24,943 WARN L194 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2020-11-07 02:18:26,024 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 120 DAG size of output: 59 [2020-11-07 02:18:27,147 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2020-11-07 02:18:27,363 WARN L194 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-11-07 02:18:28,927 WARN L194 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 140 DAG size of output: 84 [2020-11-07 02:18:30,418 WARN L194 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2020-11-07 02:18:30,829 WARN L194 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2020-11-07 02:18:32,310 WARN L194 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2020-11-07 02:18:32,611 WARN L194 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 39 [2020-11-07 02:18:32,747 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-11-07 02:18:33,476 WARN L194 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2020-11-07 02:18:33,600 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-11-07 02:18:33,950 WARN L194 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 44 [2020-11-07 02:18:34,641 WARN L194 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2020-11-07 02:18:34,833 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-11-07 02:18:35,035 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-11-07 02:18:35,169 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-11-07 02:18:35,304 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-11-07 02:18:35,679 WARN L194 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2020-11-07 02:18:36,033 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-11-07 02:18:37,156 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2020-11-07 02:18:37,529 WARN L194 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2020-11-07 02:18:37,965 WARN L194 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2020-11-07 02:18:39,261 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 166 DAG size of output: 82 [2020-11-07 02:18:40,010 WARN L194 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2020-11-07 02:18:40,289 WARN L194 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2020-11-07 02:18:42,282 WARN L194 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2020-11-07 02:18:42,438 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 32 [2020-11-07 02:18:43,216 WARN L194 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-11-07 02:18:44,130 WARN L194 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 65 [2020-11-07 02:18:44,289 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2020-11-07 02:18:44,851 WARN L194 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 51 [2020-11-07 02:18:44,963 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2020-11-07 02:18:45,152 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2020-11-07 02:18:45,789 WARN L194 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2020-11-07 02:18:46,001 WARN L194 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-11-07 02:18:46,825 WARN L194 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-11-07 02:18:47,610 WARN L194 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-11-07 02:18:47,929 WARN L194 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-11-07 02:18:50,170 WARN L194 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 159 DAG size of output: 85 [2020-11-07 02:18:50,954 WARN L194 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-11-07 02:18:53,696 WARN L194 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 192 DAG size of output: 98 [2020-11-07 02:18:53,933 WARN L194 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-11-07 02:18:54,120 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-07 02:18:54,539 WARN L194 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2020-11-07 02:18:55,902 WARN L194 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 154 DAG size of output: 76 [2020-11-07 02:18:56,456 WARN L194 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 52 [2020-11-07 02:18:56,886 WARN L194 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2020-11-07 02:18:57,750 WARN L194 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-11-07 02:18:58,671 WARN L194 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2020-11-07 02:18:59,415 WARN L194 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-11-07 02:18:59,968 WARN L194 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2020-11-07 02:19:01,415 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2020-11-07 02:19:01,558 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-11-07 02:19:02,166 WARN L194 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2020-11-07 02:19:02,631 WARN L194 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-11-07 02:19:02,981 WARN L194 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2020-11-07 02:19:03,167 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-11-07 02:19:03,272 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-11-07 02:19:06,075 WARN L194 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 192 DAG size of output: 98 [2020-11-07 02:19:06,268 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-07 02:19:07,142 WARN L194 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2020-11-07 02:19:07,799 WARN L194 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2020-11-07 02:19:08,995 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2020-11-07 02:19:09,528 WARN L194 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-11-07 02:19:10,315 WARN L194 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-11-07 02:19:10,678 WARN L194 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2020-11-07 02:19:11,172 WARN L194 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2020-11-07 02:19:12,748 WARN L194 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2020-11-07 02:19:13,164 WARN L194 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2020-11-07 02:19:14,737 WARN L194 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2020-11-07 02:19:15,109 WARN L194 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2020-11-07 02:19:16,133 WARN L194 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-11-07 02:19:16,306 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2020-11-07 02:19:16,514 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-11-07 02:19:17,252 WARN L194 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-11-07 02:19:17,435 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-07 02:19:17,742 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-11-07 02:19:18,184 WARN L194 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2020-11-07 02:19:19,180 WARN L194 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2020-11-07 02:19:19,734 WARN L194 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2020-11-07 02:19:20,246 WARN L194 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2020-11-07 02:19:20,978 WARN L194 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2020-11-07 02:19:21,957 WARN L194 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2020-11-07 02:19:22,344 WARN L194 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-11-07 02:19:23,256 WARN L194 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2020-11-07 02:19:23,450 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-07 02:19:23,623 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2020-11-07 02:19:24,171 WARN L194 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-11-07 02:19:26,368 WARN L194 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 159 DAG size of output: 85 [2020-11-07 02:19:28,633 WARN L194 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2020-11-07 02:19:29,140 WARN L194 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2020-11-07 02:19:30,711 WARN L194 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2020-11-07 02:19:30,873 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2020-11-07 02:19:31,761 WARN L194 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2020-11-07 02:19:32,797 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-11-07 02:19:33,922 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-11-07 02:19:36,116 WARN L194 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 159 DAG size of output: 85 [2020-11-07 02:19:36,974 WARN L194 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2020-11-07 02:19:38,014 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-11-07 02:19:38,203 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2020-11-07 02:19:38,649 WARN L194 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-11-07 02:19:38,838 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-11-07 02:19:39,325 WARN L194 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2020-11-07 02:19:39,637 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2020-11-07 02:19:39,778 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-11-07 02:19:39,968 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2020-11-07 02:19:41,357 WARN L194 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 146 DAG size of output: 77 [2020-11-07 02:19:41,540 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-07 02:19:41,722 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-11-07 02:19:42,387 WARN L194 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2020-11-07 02:19:43,293 WARN L194 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2020-11-07 02:19:43,598 WARN L194 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-11-07 02:19:43,739 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 1 [2020-11-07 02:19:45,595 WARN L194 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2020-11-07 02:19:45,866 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-11-07 02:19:46,947 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2020-11-07 02:19:47,403 WARN L194 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 38 [2020-11-07 02:19:47,671 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-11-07 02:19:49,600 WARN L194 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 136 DAG size of output: 80 [2020-11-07 02:19:49,956 WARN L194 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2020-11-07 02:19:50,597 WARN L194 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2020-11-07 02:19:50,708 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 1 [2020-11-07 02:19:50,994 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 40 [2020-11-07 02:19:51,438 WARN L194 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-11-07 02:19:51,446 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 02:19:51,447 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 02:19:51,447 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 02:19:51,447 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 02:19:51,448 INFO L262 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2020-11-07 02:19:51,448 INFO L262 CegarLoopResult]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2020-11-07 02:19:51,449 INFO L262 CegarLoopResult]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (= ~M_E~0 2))) (.cse11 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse13 (not (= |old(~t1_pc~0)| 0))) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (= ~m_pc~0 1))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~t1_pc~0 0)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (and .cse7 (= ~m_st~0 0) .cse8 .cse2 .cse4) .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse16 .cse9 .cse17 .cse10 .cse12 .cse18 .cse5 .cse19 .cse14) (or .cse15 .cse16 .cse9 .cse17 .cse12 .cse18 .cse5 .cse19 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)) (or .cse15 .cse9 .cse11 .cse12 .cse13 .cse18 .cse5 .cse19 (and .cse1 .cse7 .cse8 .cse2 .cse4) .cse6 .cse14))) [2020-11-07 02:19:51,449 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse17 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (and .cse11 .cse12 .cse13) .cse6 .cse8) (or (let ((.cse14 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) .cse11 (<= .cse14 ~token~0) (<= ~token~0 .cse14) .cse12 .cse13)) (let ((.cse15 (= |old(~E_M~0)| 1)) (.cse16 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse15 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)))) (or .cse10 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse9))) [2020-11-07 02:19:51,450 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse11 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse1 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse7 (= ~t1_pc~0 1)) (.cse17 (or (= ~t1_st~0 0) .cse10)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 (and .cse7 (= ~m_st~0 |old(~m_st~0)|) .cse8 .cse10 .cse11) .cse16 .cse12) (or .cse0 .cse6 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse1 .cse19 .cse2 .cse4 .cse14 .cse6 .cse15 .cse12) (or .cse13 .cse18 .cse1 .cse19 .cse4 .cse14 .cse6 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse7 (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse8 .cse9)))))) [2020-11-07 02:19:51,450 INFO L262 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2020-11-07 02:19:51,450 INFO L262 CegarLoopResult]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2020-11-07 02:19:51,451 INFO L262 CegarLoopResult]: At program point transmit1EXIT(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2020-11-07 02:19:51,451 INFO L262 CegarLoopResult]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2020-11-07 02:19:51,452 INFO L262 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse9 (not (= |old(~t1_pc~0)| 0))) (.cse13 (not (= |old(~m_st~0)| 0))) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse12) (or .cse0 .cse6 .cse13 .cse7 .cse8 .cse9 .cse3 .cse12) (or (let ((.cse14 (= |old(~E_M~0)| 1)) (.cse15 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse5 .cse14 .cse6 .cse15 .cse13 .cse8 .cse10 .cse3 .cse11 .cse12) (or .cse5 .cse14 .cse6 .cse15 .cse8 .cse10 .cse3 .cse11 .cse4 .cse12))) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse16 ~token~0) (<= ~token~0 .cse16) .cse2))))) [2020-11-07 02:19:51,452 INFO L262 CegarLoopResult]: At program point L101-1(line 101) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse14 (or (= ~t1_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (let ((.cse10 (= |old(~E_M~0)| 1)) (.cse11 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse13 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse13 ~token~0) .cse14 (<= ~token~0 .cse13) (= ~m_st~0 0)))) (or .cse15 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse15 .cse6 .cse8 (and (<= 2 ~m_st~0) .cse14)))) [2020-11-07 02:19:51,452 INFO L262 CegarLoopResult]: At program point immediate_notifyEXIT(lines 328 338) the Hoare annotation is: (let ((.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (= ~m_st~0 0)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (and .cse22 .cse14)) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (= ~t1_st~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse11 (and .cse22 (not (= ~E_1~0 1)) .cse14)) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse18 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (not .cse1) .cse2 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 (and .cse12 (not .cse13)) .cse5 .cse7 .cse8) (or (and .cse12 .cse13) (and .cse13 .cse14) (let ((.cse21 (+ ~local~0 1))) (let ((.cse15 (not (<= ~token~0 .cse21))) (.cse16 (not (<= .cse21 ~token~0))) (.cse17 (not (= ~E_M~0 1))) (.cse20 (not (<= 2 ~E_1~0)))) (and (or .cse9 .cse15 .cse2 .cse16 .cse1 .cse17 .cse5 .cse18 .cse19 .cse20) (or .cse9 .cse15 .cse2 (not .cse4) .cse16 .cse1 .cse17 .cse5 .cse18 .cse20))))) (or .cse0 (and (<= 2 ~m_st~0) .cse12) .cse5 .cse6 .cse19) (or .cse9 .cse2 .cse10 .cse12 .cse3 .cse11 .cse4 .cse5 .cse18 .cse7 .cse8)))) [2020-11-07 02:19:51,453 INFO L262 CegarLoopResult]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse1 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse14 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (not .cse1) .cse2 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse6 (let ((.cse17 (+ ~local~0 1))) (let ((.cse11 (not (<= ~token~0 .cse17))) (.cse12 (not (<= .cse17 ~token~0))) (.cse13 (not (= ~E_M~0 1))) (.cse16 (not (<= 2 ~E_1~0)))) (and (or .cse9 .cse11 .cse2 .cse12 .cse1 .cse13 .cse5 .cse14 .cse15 .cse16) (or .cse9 .cse11 .cse2 (not .cse4) .cse12 .cse1 .cse13 .cse5 .cse14 .cse16))))) (or .cse0 .cse5 .cse6 .cse15) (or .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8))) [2020-11-07 02:19:51,453 INFO L262 CegarLoopResult]: At program point immediate_notifyFINAL(lines 328 338) the Hoare annotation is: (let ((.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (= ~m_st~0 0)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (and .cse22 .cse14)) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (= ~t1_st~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse11 (and .cse22 (not (= ~E_1~0 1)) .cse14)) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse18 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (not .cse1) .cse2 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 (and .cse12 (not .cse13)) .cse5 .cse7 .cse8) (or (and .cse12 .cse13) (and .cse13 .cse14) (let ((.cse21 (+ ~local~0 1))) (let ((.cse15 (not (<= ~token~0 .cse21))) (.cse16 (not (<= .cse21 ~token~0))) (.cse17 (not (= ~E_M~0 1))) (.cse20 (not (<= 2 ~E_1~0)))) (and (or .cse9 .cse15 .cse2 .cse16 .cse1 .cse17 .cse5 .cse18 .cse19 .cse20) (or .cse9 .cse15 .cse2 (not .cse4) .cse16 .cse1 .cse17 .cse5 .cse18 .cse20))))) (or .cse0 (and (<= 2 ~m_st~0) .cse12) .cse5 .cse6 .cse19) (or .cse9 .cse2 .cse10 .cse12 .cse3 .cse11 .cse4 .cse5 .cse18 .cse7 .cse8)))) [2020-11-07 02:19:51,453 INFO L262 CegarLoopResult]: At program point L320(line 320) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (<= activate_threads_~tmp~1 0)) (.cse6 (< 0 (+ activate_threads_~tmp~1 1))) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= |old(~m_st~0)| 0)) (.cse26 (= |old(~t1_st~0)| 0))) (let ((.cse20 (not (= ~M_E~0 1))) (.cse12 (not (= ~m_pc~0 1))) (.cse19 (= ~E_M~0 1)) (.cse16 (not .cse26)) (.cse28 (not .cse10)) (.cse17 (not (= ~t1_pc~0 0))) (.cse22 (not (<= 2 ~E_1~0))) (.cse23 (= ~m_st~0 0)) (.cse21 (not (<= 2 |old(~m_st~0)|))) (.cse18 (and .cse3 .cse4 .cse6 .cse8)) (.cse5 (<= 1 activate_threads_~tmp___0~0)) (.cse7 (not (= ~E_1~0 1))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (= ~t1_i~0 1))) (.cse13 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 (or (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse6)) .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse1 .cse17 .cse9 .cse10 .cse11 .cse13 .cse14 .cse18) (or .cse0 .cse2 .cse19 .cse9 .cse11 .cse12 .cse20 .cse14 .cse21 .cse18 .cse22) (or .cse16 .cse0 .cse19 .cse9 .cse11 .cse12 .cse20 .cse14 .cse21 .cse18 .cse22) (or (and .cse23 .cse8 (<= 1 activate_threads_~tmp~1)) (let ((.cse29 (+ ~local~0 1))) (let ((.cse24 (not (<= ~token~0 .cse29))) (.cse25 (not (<= .cse29 ~token~0))) (.cse27 (not .cse19))) (and (or .cse0 .cse24 .cse1 .cse25 .cse26 .cse27 .cse11 .cse12 .cse21 .cse22) (or .cse0 .cse24 .cse1 .cse28 .cse25 .cse26 .cse27 .cse11 .cse12 .cse22))))) (or .cse15 .cse16 .cse1 .cse28 .cse17 .cse11 .cse13 .cse22 (and .cse4 .cse6 .cse23 .cse8)) (or .cse15 .cse11 .cse21 .cse18) (or (and (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse4 .cse6)) .cse8) .cse15 .cse0 .cse1 .cse2 .cse9 .cse10 .cse11 .cse13 .cse14)))) [2020-11-07 02:19:51,454 INFO L262 CegarLoopResult]: At program point L319(lines 319 323) the Hoare annotation is: (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= activate_threads_~tmp~1 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse14 (not (= ~M_E~0 1))) (.cse12 (= ~E_M~0 1)) (.cse1 (not .cse21)) (.cse23 (not .cse5)) (.cse3 (not (= ~t1_pc~0 0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (= ~m_st~0 0)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse25 .cse26 .cse18)) (.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse27 (and .cse29 .cse25 (<= 1 activate_threads_~tmp___0~0) .cse26 .cse18)) (.cse28 (and .cse29 (not (= ~E_1~0 1)) .cse25 .cse26 .cse18)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or .cse1 .cse10 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or (and .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) (let ((.cse24 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse24))) (.cse20 (not (<= .cse24 ~token~0))) (.cse22 (not .cse12))) (and (or .cse10 .cse19 .cse2 .cse20 .cse21 .cse22 .cse6 .cse13 .cse15 .cse16) (or .cse10 .cse19 .cse2 .cse23 .cse20 .cse21 .cse22 .cse6 .cse13 .cse16))))) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse7 .cse16 (and .cse25 .cse26 .cse17 .cse18)) (or .cse0 .cse6 .cse15 .cse9) (or .cse0 .cse10 .cse2 .cse27 .cse28 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse10 .cse2 .cse27 .cse28 .cse11 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8)))) [2020-11-07 02:19:51,454 INFO L262 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (not (= ~M_E~0 1))) (.cse14 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse15 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse23)) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse12 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (or .cse2 .cse5 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or .cse11 .cse2 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse14))) (and (or .cse2 .cse21 .cse3 .cse22 .cse23 .cse24 .cse8 .cse15 .cse17 .cse18) (or .cse2 .cse21 .cse3 .cse25 .cse22 .cse23 .cse24 .cse8 .cse15 .cse18))))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse25 .cse12 .cse8 .cse9 .cse18 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse17 .cse13)))) [2020-11-07 02:19:51,455 INFO L262 CegarLoopResult]: At program point L319-2(lines 303 327) the Hoare annotation is: (let ((.cse32 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse30 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse29 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse29)) (.cse19 (not (= ~t1_pc~0 0))) (.cse24 (and .cse30 .cse0 .cse21 .cse22)) (.cse18 (not .cse8)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse13 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 1))) (.cse17 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~M_E~0 2))) (.cse31 (and .cse35 .cse32 .cse21 .cse22 .cse3)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse10 (not (= ~t1_i~0 1))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse33 (<= 1 activate_threads_~tmp___0~0)) (.cse1 (= ~m_st~0 0))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse18 .cse6 .cse19 .cse25 .cse29 .cse10 .cse20 .cse27 .cse28) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse30 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse6 .cse31 .cse10 .cse11 .cse27 (and .cse32 .cse0 .cse21 .cse22) .cse4 (and .cse32 .cse0 .cse1) .cse23 .cse25 (and .cse0 .cse1 .cse33) .cse29 (and .cse0 .cse21 .cse33 .cse22) .cse20) (let ((.cse34 (not .cse1))) (or .cse17 (and .cse32 .cse0 .cse21 .cse22 .cse34) .cse4 .cse6 .cse31 .cse23 .cse25 .cse29 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse33 .cse22 .cse34)))))) [2020-11-07 02:19:51,455 INFO L262 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (not (= ~M_E~0 1))) (.cse14 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse15 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse23)) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse12 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (or .cse2 .cse5 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or .cse11 .cse2 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse14))) (and (or .cse2 .cse21 .cse3 .cse22 .cse23 .cse24 .cse8 .cse15 .cse17 .cse18) (or .cse2 .cse21 .cse3 .cse25 .cse22 .cse23 .cse24 .cse8 .cse15 .cse18))))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse25 .cse12 .cse8 .cse9 .cse18 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse17 .cse13)))) [2020-11-07 02:19:51,456 INFO L262 CegarLoopResult]: At program point L317-2(line 317) the Hoare annotation is: (let ((.cse5 (= |old(~m_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (not (= ~M_E~0 1))) (.cse12 (= ~E_M~0 1)) (.cse13 (not (= ~m_pc~0 1))) (.cse10 (not (= ~t1_pc~0 1))) (.cse25 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse18)) (.cse26 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) (<= 1 activate_threads_~tmp___0~0) .cse28 .cse18)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse1 (not .cse21)) (.cse2 (not (= ~M_E~0 2))) (.cse23 (not .cse5)) (.cse3 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse27 .cse28 .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or .cse1 .cse10 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or (and .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) (let ((.cse24 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse24))) (.cse20 (not (<= .cse24 ~token~0))) (.cse22 (not .cse12))) (and (or .cse10 .cse19 .cse2 .cse20 .cse21 .cse22 .cse6 .cse13 .cse15 .cse16) (or .cse10 .cse19 .cse2 .cse23 .cse20 .cse21 .cse22 .cse6 .cse13 .cse16))))) (or .cse10 .cse2 .cse25 .cse26 .cse11 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8) (or .cse0 .cse10 .cse2 .cse25 .cse26 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse7 .cse16 (and .cse27 .cse28 .cse17 .cse18)) (or .cse0 .cse6 .cse15 .cse9)))) [2020-11-07 02:19:51,456 INFO L262 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse4 (= |old(~m_st~0)| 0))) (let ((.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse20 (not .cse4)) (.cse15 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not .cse18)) (.cse0 (not (= ~t1_pc~0 1))) (.cse11 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse12 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse5 .cse10) (or .cse0 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse8 .cse10 .cse13) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (or .cse9 .cse14 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (or (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse11))) (and (or .cse0 .cse16 .cse1 .cse17 .cse18 .cse19 .cse5 .cse6 .cse10 .cse13) (or .cse0 .cse16 .cse1 .cse20 .cse17 .cse18 .cse19 .cse5 .cse6 .cse13))))) (or .cse9 .cse14 .cse1 .cse20 .cse15 .cse5 .cse7 .cse13) (or .cse14 .cse0 .cse11 .cse3 .cse5 .cse6 .cse12 .cse8 .cse10 .cse13)))) [2020-11-07 02:19:51,457 INFO L262 CegarLoopResult]: At program point L311(lines 311 315) the Hoare annotation is: (let ((.cse21 (= |old(~t1_st~0)| 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (<= activate_threads_~tmp~1 0)) (.cse8 (< 0 (+ activate_threads_~tmp~1 1))) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= |old(~m_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse3 (not .cse12)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse18 .cse7 .cse8 .cse9)) (.cse1 (not .cse21)) (.cse15 (not (= ~t1_pc~0 1))) (.cse24 (= ~E_M~0 1)) (.cse11 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse26 (not (= ~M_E~0 1))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse23 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 (= ~m_st~0 0) .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14) (or .cse15 .cse2 .cse16 .cse11 .cse12 .cse5 .cse17 .cse6 .cse13 .cse14) (or (and .cse18 .cse9 (<= 1 activate_threads_~tmp~1)) (let ((.cse25 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse25))) (.cse20 (not (<= .cse25 ~token~0))) (.cse22 (not .cse24))) (and (or .cse15 .cse19 .cse2 .cse20 .cse21 .cse22 .cse5 .cse17 .cse23 .cse10) (or .cse15 .cse19 .cse2 .cse3 .cse20 .cse21 .cse22 .cse5 .cse17 .cse10))))) (or .cse0 .cse5 .cse23 .cse14) (or .cse0 .cse15 .cse2 .cse16 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14) (or .cse15 .cse16 .cse24 .cse11 .cse5 .cse17 .cse26 .cse13 .cse23 .cse10 .cse14) (or .cse1 .cse15 .cse24 .cse11 .cse5 .cse17 .cse26 .cse13 .cse23 .cse10 (and .cse18 (= ~t1_st~0 0) .cse7 .cse8))))) [2020-11-07 02:19:51,457 INFO L262 CegarLoopResult]: At program point L309(line 309) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse22 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse22)) (.cse3 (not (= ~t1_pc~0 0))) (.cse18 (not .cse5)) (.cse0 (not (= ~m_pc~0 0))) (.cse11 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse14 .cse19)) (.cse12 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse6 .cse12 .cse13 (and .cse14 (= ~t1_st~0 0)) .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse6 (and (= ~m_st~0 0) .cse19) .cse8 .cse16) (or .cse7 (let ((.cse24 (+ ~local~0 1))) (let ((.cse20 (not (<= ~token~0 .cse24))) (.cse21 (not (<= .cse24 ~token~0))) (.cse23 (not .cse11))) (and (or .cse10 .cse20 .cse2 .cse21 .cse22 .cse23 .cse6 .cse12 .cse15 .cse16) (or .cse10 .cse20 .cse2 .cse18 .cse21 .cse22 .cse23 .cse6 .cse12 .cse16))))) (or .cse0 .cse6 .cse7 .cse15) (or .cse10 .cse17 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13 .cse9 .cse15 .cse16) (or .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9)))) [2020-11-07 02:19:51,458 INFO L262 CegarLoopResult]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse25 (<= activate_threads_~tmp~1 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse14 (not (= ~M_E~0 1))) (.cse12 (= ~E_M~0 1)) (.cse13 (not (= ~m_pc~0 1))) (.cse1 (not .cse21)) (.cse23 (not .cse5)) (.cse3 (not (= ~t1_pc~0 0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (= ~m_st~0 0)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (and (= ~m_st~0 |old(~m_st~0)|) .cse25 .cse26 .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or .cse1 .cse10 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or (and .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) (let ((.cse24 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse24))) (.cse20 (not (<= .cse24 ~token~0))) (.cse22 (not .cse12))) (and (or .cse10 .cse19 .cse2 .cse20 .cse21 .cse22 .cse6 .cse13 .cse15 .cse16) (or .cse10 .cse19 .cse2 .cse23 .cse20 .cse21 .cse22 .cse6 .cse13 .cse16))))) (or .cse10 .cse2 .cse11 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse7 .cse16 (and .cse25 .cse26 .cse17 .cse18)) (or .cse0 .cse6 .cse15 .cse9) (or .cse0 .cse10 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 02:19:51,458 INFO L262 CegarLoopResult]: At program point L309-1(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse14 (not (= ~M_E~0 1))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse17 (not .cse6)) (.cse12 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 ~E_1~0))) (.cse13 (= ~E_M~0 1)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (and .cse21 .cse18 .cse19 .cse20)) (.cse7 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse1 .cse3 .cse17 .cse4 .cse7 .cse8 .cse16 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse10 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse3 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse13))) (and (or .cse10 .cse22 .cse3 .cse23 .cse24 .cse25 .cse7 .cse12 .cse15 .cse16) (or .cse10 .cse22 .cse3 .cse17 .cse23 .cse24 .cse25 .cse7 .cse12 .cse16))))) (or .cse0 .cse2 .cse7 .cse15)))) [2020-11-07 02:19:51,458 INFO L262 CegarLoopResult]: At program point L309-2(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse14 (not (= ~M_E~0 1))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse17 (not .cse6)) (.cse12 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 ~E_1~0))) (.cse13 (= ~E_M~0 1)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (and .cse21 .cse18 .cse19 .cse20)) (.cse7 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse1 .cse3 .cse17 .cse4 .cse7 .cse8 .cse16 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse10 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse3 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse13))) (and (or .cse10 .cse22 .cse3 .cse23 .cse24 .cse25 .cse7 .cse12 .cse15 .cse16) (or .cse10 .cse22 .cse3 .cse17 .cse23 .cse24 .cse25 .cse7 .cse12 .cse16))))) (or .cse0 .cse2 .cse7 .cse15)))) [2020-11-07 02:19:51,459 INFO L262 CegarLoopResult]: At program point L309-3(line 309) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (<= activate_threads_~tmp~1 0)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse24 (<= |activate_threads_#t~ret11| 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~t1_st~0)| 0)) (.cse28 (= |old(~m_st~0)| 0))) (let ((.cse12 (not .cse28)) (.cse13 (= ~E_M~0 1)) (.cse17 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= 2 ~E_1~0))) (.cse21 (not .cse6)) (.cse26 (not (= ~t1_pc~0 0))) (.cse20 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse27 (not (= ~E_M~0 ~M_E~0))) (.cse18 (and .cse0 .cse22 .cse23 .cse24 .cse1 .cse25)) (.cse19 (not (<= ~local~0 ~token~0)))) (and (or (and .cse0 (<= 1 |activate_threads_#t~ret11|) .cse1 (<= 1 activate_threads_~tmp~1)) (let ((.cse14 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 .cse14))) (.cse5 (not (<= .cse14 ~token~0))) (.cse7 (not .cse13))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11))))) (or .cse2 .cse15 .cse13 .cse16 .cse8 .cse9 .cse17 .cse18 .cse19 .cse10 .cse11) (or .cse20 .cse21 .cse4 (and .cse22 .cse23 (= ~m_st~0 0) .cse24 .cse1 .cse25) .cse12 .cse26 .cse8 .cse27 .cse11) (or .cse20 .cse8 .cse18 .cse10) (or (and .cse0 (= ~t1_st~0 0) .cse22 .cse23 .cse24 .cse25) .cse21 .cse2 .cse13 .cse16 .cse8 .cse9 .cse17 .cse19 .cse10 .cse11) (or .cse20 .cse21 .cse4 .cse26 .cse16 .cse28 .cse8 .cse18 .cse27 .cse19) (or .cse20 .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse18 .cse27 .cse19) (or .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse9 .cse27 .cse18 .cse19)))) [2020-11-07 02:19:51,459 INFO L262 CegarLoopResult]: At program point L305(line 305) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse22 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse22)) (.cse3 (not (= ~t1_pc~0 0))) (.cse18 (not .cse5)) (.cse0 (not (= ~m_pc~0 0))) (.cse11 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse14 .cse19)) (.cse12 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse6 .cse12 .cse13 (and .cse14 (= ~t1_st~0 0)) .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse6 (and (= ~m_st~0 0) .cse19) .cse8 .cse16) (or .cse7 (let ((.cse24 (+ ~local~0 1))) (let ((.cse20 (not (<= ~token~0 .cse24))) (.cse21 (not (<= .cse24 ~token~0))) (.cse23 (not .cse11))) (and (or .cse10 .cse20 .cse2 .cse21 .cse22 .cse23 .cse6 .cse12 .cse15 .cse16) (or .cse10 .cse20 .cse2 .cse18 .cse21 .cse22 .cse23 .cse6 .cse12 .cse16))))) (or .cse0 .cse6 .cse7 .cse15) (or .cse10 .cse17 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13 .cse9 .cse15 .cse16) (or .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9)))) [2020-11-07 02:19:51,460 INFO L262 CegarLoopResult]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse22 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse22)) (.cse3 (not (= ~t1_pc~0 0))) (.cse18 (not .cse5)) (.cse0 (not (= ~m_pc~0 0))) (.cse11 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse14 .cse19)) (.cse12 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse6 .cse12 .cse13 (and .cse14 (= ~t1_st~0 0)) .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse6 (and (= ~m_st~0 0) .cse19) .cse8 .cse16) (or .cse7 (let ((.cse24 (+ ~local~0 1))) (let ((.cse20 (not (<= ~token~0 .cse24))) (.cse21 (not (<= .cse24 ~token~0))) (.cse23 (not .cse11))) (and (or .cse10 .cse20 .cse2 .cse21 .cse22 .cse23 .cse6 .cse12 .cse15 .cse16) (or .cse10 .cse20 .cse2 .cse18 .cse21 .cse22 .cse23 .cse6 .cse12 .cse16))))) (or .cse0 .cse6 .cse7 .cse15) (or .cse10 .cse17 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13 .cse9 .cse15 .cse16) (or .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9)))) [2020-11-07 02:19:51,460 INFO L262 CegarLoopResult]: At program point activate_threadsEXIT(lines 303 327) the Hoare annotation is: (let ((.cse32 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse30 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse29 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse29)) (.cse19 (not (= ~t1_pc~0 0))) (.cse24 (and .cse30 .cse0 .cse21 .cse22)) (.cse18 (not .cse8)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse13 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 1))) (.cse17 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~M_E~0 2))) (.cse31 (and .cse35 .cse32 .cse21 .cse22 .cse3)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse10 (not (= ~t1_i~0 1))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse33 (<= 1 activate_threads_~tmp___0~0)) (.cse1 (= ~m_st~0 0))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse18 .cse6 .cse19 .cse25 .cse29 .cse10 .cse20 .cse27 .cse28) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse30 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse6 .cse31 .cse10 .cse11 .cse27 (and .cse32 .cse0 .cse21 .cse22) .cse4 (and .cse32 .cse0 .cse1) .cse23 .cse25 (and .cse0 .cse1 .cse33) .cse29 (and .cse0 .cse21 .cse33 .cse22) .cse20) (let ((.cse34 (not .cse1))) (or .cse17 (and .cse32 .cse0 .cse21 .cse22 .cse34) .cse4 .cse6 .cse31 .cse23 .cse25 .cse29 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse33 .cse22 .cse34)))))) [2020-11-07 02:19:51,460 INFO L262 CegarLoopResult]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (= ~E_M~0 1)) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~M_E~0 2))) (.cse14 (not (= ~t1_pc~0 0))) (.cse11 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse8) (or .cse0 .cse2 .cse14 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse15 .cse5 .cse13 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse1 .cse2 (not (<= ~token~0 .cse16)) (not (<= .cse16 ~token~0)) .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse2 .cse14 .cse11 .cse3 .cse12 .cse15 .cse5 .cse6 .cse13 .cse8))) [2020-11-07 02:19:51,461 INFO L262 CegarLoopResult]: At program point L191(line 191) the Hoare annotation is: (let ((.cse10 (not (= ~t1_pc~0 0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse5 (not (= ~m_pc~0 1))) (.cse9 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~t1_st~0))) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (= ~E_M~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse8) (or .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (or .cse9 .cse0 .cse4 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse13)) .cse2 (not (<= .cse13 ~token~0)) .cse4 .cse5 .cse14 .cse11 .cse12 .cse8)) (or .cse9 .cse1 .cse2 .cse4 .cse14 .cse11 .cse12 .cse8))) [2020-11-07 02:19:51,461 INFO L262 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2020-11-07 02:19:51,461 INFO L262 CegarLoopResult]: At program point L185(line 185) the Hoare annotation is: (let ((.cse2 (= ~t1_st~0 0)) (.cse1 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse3 (not .cse2) .cse5 .cse6 .cse7) (let ((.cse9 (+ ~local~0 1))) (or .cse8 (not (<= ~token~0 .cse9)) .cse4 (not (<= .cse9 ~token~0)) .cse3 .cse10 .cse11 .cse5 .cse6 .cse7)) (or .cse1 .cse8 .cse4 (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) .cse3 .cse10 .cse11 (not (<= ~local~0 ~token~0)) .cse7) (or .cse0 .cse8 .cse4 .cse3 .cse11 .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,462 INFO L262 CegarLoopResult]: At program point L184(lines 184 189) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (= ~t1_pc~0 0)) .cse2 (not (= ~t1_st~0 0)) .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse7)) .cse1 (not (<= .cse7 ~token~0)) .cse2 (not (= ~m_pc~0 1)) .cse8 .cse3 .cse4 .cse5)) (or .cse0 .cse6 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5))) [2020-11-07 02:19:51,462 INFO L269 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2020-11-07 02:19:51,462 INFO L262 CegarLoopResult]: At program point L181(line 181) the Hoare annotation is: (let ((.cse7 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 ~M_E~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or (not (= ~m_pc~0 0)) .cse0 .cse5))) [2020-11-07 02:19:51,462 INFO L269 CegarLoopResult]: At program point L180(lines 180 190) the Hoare annotation is: true [2020-11-07 02:19:51,462 INFO L262 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2020-11-07 02:19:51,463 INFO L262 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2020-11-07 02:19:51,463 INFO L269 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2020-11-07 02:19:51,463 INFO L262 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2020-11-07 02:19:51,463 INFO L262 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2020-11-07 02:19:51,464 INFO L262 CegarLoopResult]: At program point L137(line 137) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 0)) (.cse6 (= ~m_st~0 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (<= 2 ~t1_st~0))) (.cse1 (not (= ~M_E~0 2))) (.cse14 (not .cse6)) (.cse9 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse5 (not .cse18)) (.cse16 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse1 .cse3 .cse4 .cse11 .cse12 .cse7 .cse8 .cse13) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse14 .cse13) (or .cse9 .cse10 .cse15 .cse3 .cse4 .cse11 .cse12 .cse16 .cse8 .cse13) (let ((.cse17 (+ ~local~0 1))) (or .cse10 (not (<= ~token~0 .cse17)) .cse1 (not (<= .cse17 ~token~0)) .cse18 (not .cse15) .cse4 .cse11 .cse14 .cse13)) (or .cse9 .cse10 .cse15 .cse3 .cse4 .cse11 .cse5 .cse16 .cse8 .cse13)))) [2020-11-07 02:19:51,464 INFO L262 CegarLoopResult]: At program point L136(lines 136 141) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_pc~0 0))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~t1_st~0 0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse5 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 .cse6 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (not .cse5) (not (<= 2 ~E_1~0))))) [2020-11-07 02:19:51,464 INFO L269 CegarLoopResult]: At program point L135(lines 135 144) the Hoare annotation is: true [2020-11-07 02:19:51,464 INFO L262 CegarLoopResult]: At program point L135-2(lines 135 144) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,464 INFO L262 CegarLoopResult]: At program point L289-1(lines 278 301) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 ~M_E~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse7 (not (= 2 |old(~M_E~0)|))) (.cse13 (= ~M_E~0 2))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse2 .cse12 .cse13)) (or .cse0 (and .cse2 .cse12 .cse14) (not (= ~t1_pc~0 0)) .cse6 .cse3 .cse7 .cse9 .cse10 (not (= ~m_st~0 0))) (or (and .cse2 .cse13 .cse14) .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse11) (or .cse0 .cse1 .cse3 .cse7 .cse13))) [2020-11-07 02:19:51,465 INFO L262 CegarLoopResult]: At program point L285(line 285) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15) (or .cse5 .cse7 .cse12 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15)))) [2020-11-07 02:19:51,465 INFO L262 CegarLoopResult]: At program point L279-1(lines 278 301) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (= ~t1_st~0 0))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15)))) [2020-11-07 02:19:51,465 INFO L262 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_st~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse12 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse13 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 .cse10 (not (= ~m_st~0 0))) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 .cse9 .cse10 .cse14) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 (not (<= 2 ~t1_st~0)) .cse9 .cse14)))) [2020-11-07 02:19:51,466 INFO L262 CegarLoopResult]: At program point L294-1(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2020-11-07 02:19:51,466 INFO L262 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10) (or .cse0 .cse1 .cse2 .cse6 (= ~M_E~0 2)))) [2020-11-07 02:19:51,466 INFO L262 CegarLoopResult]: At program point L284-1(lines 278 301) the Hoare annotation is: (let ((.cse11 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_pc~0 0))) (.cse14 (= ~M_E~0 2)) (.cse1 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse12 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse1 .cse5 .cse6 .cse7 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse13 .cse14)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 .cse13 (= ~M_E~0 |old(~M_E~0)|)) .cse7 .cse4 .cse8 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse4 .cse8 .cse14) (or .cse1 .cse5 (and .cse2 .cse13 .cse3) .cse6 .cse7 .cse4 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse12))) [2020-11-07 02:19:51,466 INFO L262 CegarLoopResult]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1 .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse6) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10))) [2020-11-07 02:19:51,467 INFO L262 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2020-11-07 02:19:51,467 INFO L262 CegarLoopResult]: At program point L295(line 295) the Hoare annotation is: (let ((.cse8 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse4) (or .cse10 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse10 .cse0 .cse4 .cse5 (= ~M_E~0 2)))) [2020-11-07 02:19:51,467 INFO L262 CegarLoopResult]: At program point L162-1(lines 161 174) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-11-07 02:19:51,467 INFO L262 CegarLoopResult]: At program point init_threadsEXIT(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-11-07 02:19:51,468 INFO L262 CegarLoopResult]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,468 INFO L262 CegarLoopResult]: At program point L170(line 170) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,468 INFO L262 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-11-07 02:19:51,468 INFO L262 CegarLoopResult]: At program point L167-1(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-11-07 02:19:51,468 INFO L262 CegarLoopResult]: At program point L165(line 165) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,468 INFO L262 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,469 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 464 475) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,469 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 464 475) the Hoare annotation is: true [2020-11-07 02:19:51,469 INFO L269 CegarLoopResult]: At program point L473(line 473) the Hoare annotation is: true [2020-11-07 02:19:51,469 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 464 475) the Hoare annotation is: true [2020-11-07 02:19:51,469 INFO L269 CegarLoopResult]: At program point L470(line 470) the Hoare annotation is: true [2020-11-07 02:19:51,469 INFO L262 CegarLoopResult]: At program point L469(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,470 INFO L262 CegarLoopResult]: At program point L469-1(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,470 INFO L269 CegarLoopResult]: At program point errorEXIT(lines 8 15) the Hoare annotation is: true [2020-11-07 02:19:51,470 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 02:19:51,470 INFO L269 CegarLoopResult]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2020-11-07 02:19:51,470 INFO L269 CegarLoopResult]: At program point errorFINAL(lines 8 15) the Hoare annotation is: true [2020-11-07 02:19:51,470 INFO L262 CegarLoopResult]: At program point masterEXIT(lines 32 75) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse19 (= ~t1_i~0 1)) (.cse18 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse18)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse19)) (.cse14 (and .cse5 .cse17 (= ~t1_st~0 0) .cse6 .cse18 .cse7 .cse19 .cse8 .cse9)) (.cse15 (and .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse4 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 (not (<= .cse16 |old(~token~0)|))))))) [2020-11-07 02:19:51,471 INFO L262 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse13 (= ~m_pc~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse18)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (and .cse18 .cse11 .cse12 .cse17 .cse13 .cse16 .cse14 .cse15)) (.cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse18 .cse16 .cse17 .cse12 .cse13 .cse14 .cse15 (= |old(~t1_st~0)| ~t1_st~0))) (.cse1 (not .cse17)) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse16)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse2 |old(~token~0)|)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse6 .cse7 .cse9 .cse10)))) [2020-11-07 02:19:51,471 INFO L262 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse5 (and .cse10 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14)) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse9)) .cse2 (and .cse10 .cse11 .cse12 (= ~m_pc~0 1) .cse13 .cse14) .cse3 .cse4 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse6 .cse5 .cse7 .cse8)))) [2020-11-07 02:19:51,471 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-11-07 02:19:51,472 INFO L262 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (and .cse10 .cse11 (= ~m_pc~0 0) .cse12)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse9)) .cse8 .cse1 .cse2 .cse3 (and .cse10 .cse11 (= ~m_pc~0 1) .cse12) .cse5 (not (<= .cse9 |old(~token~0)|))))))) [2020-11-07 02:19:51,472 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-11-07 02:19:51,472 INFO L262 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse8)) .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse6 (not (<= .cse8 |old(~token~0)|)))))) [2020-11-07 02:19:51,472 INFO L262 CegarLoopResult]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse19 (= ~t1_i~0 1)) (.cse18 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse18)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse19)) (.cse14 (and .cse5 .cse17 (= ~t1_st~0 0) .cse6 .cse18 .cse7 .cse19 .cse8 .cse9)) (.cse15 (and .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse4 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 (not (<= .cse16 |old(~token~0)|))))))) [2020-11-07 02:19:51,473 INFO L262 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse8)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))))) [2020-11-07 02:19:51,473 INFO L262 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-11-07 02:19:51,473 INFO L262 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse14 (= ~m_pc~0 0))) (let ((.cse4 (and .cse16 .cse10 .cse11 .cse12 .cse14)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse15 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse15)) .cse8 .cse1 (and .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse16 .cse10 .cse11 .cse12) .cse2 .cse3 .cse5 (not (<= .cse15 |old(~token~0)|))))))) [2020-11-07 02:19:51,474 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse0 (and .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13)) (.cse7 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= |old(~m_st~0)| 0)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse1 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 (and .cse10 .cse11 (= ~m_pc~0 1) .cse12 .cse13) .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse0 .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-11-07 02:19:51,474 INFO L262 CegarLoopResult]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse5 (= ~m_pc~0 0))) (let ((.cse9 (and .cse16 .cse2 .cse3 .cse5)) (.cse14 (not (= |old(~m_pc~0)| 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (not (= ~E_1~0 1))) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= |old(~m_st~0)| 0)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (= ~t1_i~0 1))) (.cse13 (not (= ~E_M~0 ~M_E~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (= |old(~t1_st~0)| 0)) .cse7 (not (= ~t1_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse7 (not (<= |old(~token~0)| .cse15)) .cse8 (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse10 .cse11 .cse12 (and .cse16 .cse2 .cse3) .cse13 (not (<= .cse15 |old(~token~0)|))))))) [2020-11-07 02:19:51,474 INFO L262 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (and .cse10 .cse11 (= ~m_pc~0 0) .cse12)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse9)) .cse8 .cse1 .cse2 .cse3 (and .cse10 .cse11 (= ~m_pc~0 1) .cse12) .cse5 (not (<= .cse9 |old(~token~0)|))))))) [2020-11-07 02:19:51,474 INFO L262 CegarLoopResult]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 (let ((.cse10 (+ ~local~0 1))) (and (<= .cse10 ~token~0) (<= ~token~0 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15)) .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-11-07 02:19:51,475 INFO L262 CegarLoopResult]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse8)) .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse6 (not (<= .cse8 |old(~token~0)|)))))) [2020-11-07 02:19:51,475 INFO L262 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2020-11-07 02:19:51,475 INFO L262 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (= ~M_E~0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse4 .cse6))) [2020-11-07 02:19:51,475 INFO L262 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2020-11-07 02:19:51,476 INFO L262 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,476 INFO L262 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,476 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,476 INFO L262 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,476 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-11-07 02:19:51,476 INFO L262 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,477 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~E_M~0 |old(~E_M~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~m_i~0 |old(~m_i~0)|)) [2020-11-07 02:19:51,478 INFO L262 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,479 INFO L262 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-11-07 02:19:51,479 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-11-07 02:19:51,479 INFO L262 CegarLoopResult]: At program point stop_simulationFINAL(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,479 INFO L262 CegarLoopResult]: At program point L401(lines 390 403) the Hoare annotation is: (or (and (<= stop_simulation_~tmp~2 0) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,479 INFO L262 CegarLoopResult]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (and (<= stop_simulation_~tmp~2 0) (<= 0 stop_simulation_~tmp~2))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8 .cse9))) [2020-11-07 02:19:51,480 INFO L262 CegarLoopResult]: At program point L395(line 395) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,480 INFO L262 CegarLoopResult]: At program point L394(lines 394 399) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (and (<= stop_simulation_~tmp~2 0) (<= 0 stop_simulation_~tmp~2)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,480 INFO L269 CegarLoopResult]: At program point L392(line 392) the Hoare annotation is: true [2020-11-07 02:19:51,480 INFO L262 CegarLoopResult]: At program point L392-1(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,480 INFO L262 CegarLoopResult]: At program point L392-2(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,480 INFO L262 CegarLoopResult]: At program point stop_simulationEXIT(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,481 INFO L262 CegarLoopResult]: At program point L392-3(line 392) the Hoare annotation is: (or (and (<= stop_simulation_~tmp~2 0) (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0) (<= 0 stop_simulation_~tmp~2)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-11-07 02:19:51,481 INFO L269 CegarLoopResult]: At program point L388(line 388) the Hoare annotation is: true [2020-11-07 02:19:51,481 INFO L269 CegarLoopResult]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2020-11-07 02:19:51,481 INFO L262 CegarLoopResult]: At program point L217(line 217) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse3 (not (= eval_~tmp~0 0)))) (let ((.cse13 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse7 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse14 (let ((.cse16 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse16) (<= .cse16 ~token~0) .cse11 .cse2 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse3))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |old(~token~0)| ~token~0))) (or .cse0 (and (= ~local~0 |old(~local~0)|) .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 (= |old(~t1_st~0)| ~t1_st~0) .cse6) .cse7 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse8 .cse9 (and .cse1 (or (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse10 .cse11 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse4 .cse5)) (and .cse10 .cse11 .cse4 .cse5 .cse6)) .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse13 .cse14)) (or .cse9 .cse13 .cse15) (or (not (= |old(~m_pc~0)| 1)) .cse0 (= |old(~E_M~0)| 1) .cse7 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse8 .cse9 .cse14 .cse15)))) [2020-11-07 02:19:51,482 INFO L262 CegarLoopResult]: At program point L213(line 213) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-11-07 02:19:51,482 INFO L262 CegarLoopResult]: At program point L205(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2020-11-07 02:19:51,483 INFO L262 CegarLoopResult]: At program point L205-1(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2020-11-07 02:19:51,483 INFO L262 CegarLoopResult]: At program point L205-2(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse3 (not (= |eval_#t~ret8| 0))) (.cse20 (= ~t1_st~0 0)) (.cse5 (not (= eval_~tmp~0 0))) (.cse26 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse21 (= ~E_M~0 ~M_E~0)) (.cse4 (<= ~token~0 ~local~0)) (.cse22 (= ~m_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (let ((.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse19 (not (= |old(~m_pc~0)| 0))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (and .cse26 .cse17 .cse1 .cse21 .cse4 .cse22 .cse23 .cse6)) (.cse13 (and .cse17 .cse1 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse6)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (let ((.cse27 (+ ~local~0 1))) (and .cse26 (<= ~token~0 .cse27) (<= .cse27 ~token~0) .cse1 .cse3 .cse21 .cse22 .cse23 .cse25 .cse5))) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (and (or .cse0 (not (= |old(~t1_pc~0)| 1)) (and .cse1 (= ~m_st~0 |old(~m_st~0)|) .cse2 .cse3 (= ~m_pc~0 |old(~m_pc~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (= |old(~m_pc~0)| 1)) .cse11 (= |old(~E_M~0)| 1) .cse12 .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 .cse15 .cse16) (or .cse10 (and .cse17 .cse18) .cse19 .cse16) (let ((.cse24 (= ~t1_pc~0 0))) (or .cse0 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse19 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse17 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse24 .cse6) .cse14 .cse15 (and (= ~local~0 |old(~local~0)|) .cse3 .cse2 .cse5 .cse25 .cse24 .cse18 .cse7 .cse9 .cse8) (and .cse26 .cse1 .cse3 .cse2 .cse21 .cse25 .cse5 .cse18 .cse9)))))) [2020-11-07 02:19:51,484 INFO L262 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2020-11-07 02:19:51,484 INFO L262 CegarLoopResult]: At program point evalEXIT(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2020-11-07 02:19:51,484 INFO L262 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (not (= eval_~tmp~0 0))) (.cse6 (not (= ~m_st~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse13 (let ((.cse16 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse16) (<= .cse16 ~token~0) .cse11 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse6))) (.cse9 (not (= ~t1_i~0 1))) (.cse14 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= |old(~token~0)| ~token~0)) (.cse5 (= ~m_pc~0 0)) (.cse2 (= ~E_1~0 |old(~E_1~0)|))) (or .cse0 .cse1 (and .cse2 (= ~t1_st~0 0) .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse8 .cse9 (and (or (and .cse10 .cse11 .cse5 .cse6 .cse7) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse10 .cse11 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse5 .cse6))) .cse2 .cse4 (= ~E_M~0 |old(~E_M~0)|)) .cse13 .cse14)) (or (not (= |old(~m_pc~0)| 1)) .cse0 (= |old(~E_M~0)| 1) .cse1 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse8 .cse9 .cse13 .cse15) (or .cse9 .cse14 .cse15)))) [2020-11-07 02:19:51,485 INFO L262 CegarLoopResult]: At program point L214(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-11-07 02:19:51,485 INFO L262 CegarLoopResult]: At program point L214-1(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-11-07 02:19:51,485 INFO L262 CegarLoopResult]: At program point L214-2(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-11-07 02:19:51,486 INFO L262 CegarLoopResult]: At program point L231(line 231) the Hoare annotation is: (let ((.cse6 (= ~t1_i~0 1))) (let ((.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse14 (not .cse6)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse12 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse16 (not (= |old(~m_pc~0)| 0))) (.cse9 (not (= eval_~tmp~0 0))) (.cse11 (= ~E_M~0 |old(~E_M~0)|))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) .cse12) .cse13 .cse14 .cse15) (or (and .cse2 .cse4 (= ~m_pc~0 0)) .cse14 .cse16 .cse15) (let ((.cse17 (= ~t1_pc~0 0))) (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse2 .cse4 .cse5 .cse7 .cse12 .cse8 .cse9 .cse17 .cse10) .cse13 .cse14 (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11) .cse16 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse17 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= |old(~token~0)| ~token~0))))))) [2020-11-07 02:19:51,486 INFO L262 CegarLoopResult]: At program point L227(line 227) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-11-07 02:19:51,486 INFO L262 CegarLoopResult]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= ~M_E~0 2))) (.cse1 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse9 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or (not (= |old(~m_pc~0)| 1)) .cse11 (and .cse2 .cse3 (= ~t1_st~0 0) .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse7 .cse8) (= |old(~E_M~0)| 1) .cse12 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 .cse0 .cse10) (or .cse11 .cse12 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse3 .cse4 (= ~E_M~0 ~M_E~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse6 .cse8) .cse13 .cse0 .cse9))) [2020-11-07 02:19:51,487 INFO L262 CegarLoopResult]: At program point L215(lines 215 222) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-11-07 02:19:51,487 INFO L262 CegarLoopResult]: At program point L207(lines 207 211) the Hoare annotation is: (let ((.cse13 (= ~t1_st~0 0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (<= 2 ~t1_st~0)) (.cse20 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~m_pc~0 1)) (.cse17 (<= 2 ~E_1~0)) (.cse8 (= ~m_st~0 0)) (.cse7 (not (= eval_~tmp~0 0)))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0)) (.cse21 (let ((.cse26 (+ ~local~0 1))) (and .cse19 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse20 .cse14 .cse16 .cse17 .cse8 .cse7))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse23 (and .cse19 .cse1 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18)) (.cse24 (and .cse1 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse9 (= ~t1_pc~0 0))) (or .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse9 .cse18) (and .cse19 .cse20 .cse6 .cse14 .cse8 .cse7 .cse2 .cse11) .cse0 .cse3 .cse21 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse20 (= ~m_st~0 |old(~m_st~0)|) .cse6 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse7 .cse18 .cse10 .cse12 .cse11) .cse21 (not (= |old(~m_pc~0)| 1)) .cse22 (= |old(~E_M~0)| 1) .cse23 .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2020-11-07 02:19:51,488 INFO L262 CegarLoopResult]: At program point L207-1(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2020-11-07 02:19:51,488 INFO L262 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2020-11-07 02:19:51,489 INFO L262 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_st~0 0)) (.cse19 (= |old(~token~0)| ~token~0)) (.cse16 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (<= 2 ~m_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse12 (<= 2 ~E_1~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse13 (not (= eval_~tmp~0 0))) (.cse14 (<= ~local~0 ~token~0)) (.cse10 (= ~m_pc~0 1)) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse15 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) .cse16 .cse0 (and .cse17 .cse8 .cse11 .cse18 .cse13 .cse15 .cse2 .cse19) (and .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) .cse3)) (let ((.cse20 (= ~E_M~0 |old(~E_M~0)|))) (or (not (= |old(~m_pc~0)| 1)) .cse5 .cse6 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse7 .cse17 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse20 .cse19) .cse16 .cse0 (and (or (and .cse1 .cse7 .cse9 .cse12 .cse11 .cse13 .cse14 .cse20) (and .cse1 .cse7 .cse8 .cse9 .cse12 .cse11 .cse13 .cse14)) .cse10) .cse4)))) [2020-11-07 02:19:51,489 INFO L262 CegarLoopResult]: At program point L228(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-11-07 02:19:51,489 INFO L262 CegarLoopResult]: At program point L228-1(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-11-07 02:19:51,490 INFO L262 CegarLoopResult]: At program point L228-2(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-11-07 02:19:51,490 INFO L262 CegarLoopResult]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2020-11-07 02:19:51,490 INFO L262 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2020-11-07 02:19:51,491 INFO L262 CegarLoopResult]: At program point L229(lines 229 236) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-11-07 02:19:51,491 INFO L262 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse4 (not (= ~t1_pc~0 1)) .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse5 .cse8 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse9 (not (<= ~local~0 ~token~0)))))) [2020-11-07 02:19:51,492 INFO L262 CegarLoopResult]: At program point L256-1(lines 250 273) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 .cse4 .cse5 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 (= ~M_E~0 |old(~M_E~0)|) .cse3) .cse6 .cse4 .cse5 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (and .cse2 (= ~E_M~0 ~M_E~0) .cse3) (not (<= ~token~0 ~local~0)) .cse6 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))))) [2020-11-07 02:19:51,492 INFO L262 CegarLoopResult]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1 .cse2) (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse2 .cse3 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse2 .cse3 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))))) [2020-11-07 02:19:51,492 INFO L262 CegarLoopResult]: At program point L267(line 267) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2020-11-07 02:19:51,492 INFO L262 CegarLoopResult]: At program point L261-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (and .cse2 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse3 .cse6 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2020-11-07 02:19:51,493 INFO L262 CegarLoopResult]: At program point L257(line 257) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2020-11-07 02:19:51,493 INFO L262 CegarLoopResult]: At program point L251-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2020-11-07 02:19:51,493 INFO L262 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 02:19:51,493 INFO L262 CegarLoopResult]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 02:19:51,494 INFO L262 CegarLoopResult]: At program point L262(line 262) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2020-11-07 02:19:51,494 INFO L269 CegarLoopResult]: At program point update_channelsEXIT(lines 150 157) the Hoare annotation is: true [2020-11-07 02:19:51,494 INFO L269 CegarLoopResult]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2020-11-07 02:19:51,495 INFO L262 CegarLoopResult]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0))) (or (and (<= 2 ~m_st~0) (= ~M_E~0 2) .cse0 .cse1) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)))) [2020-11-07 02:19:51,495 INFO L269 CegarLoopResult]: At program point start_simulationEXIT(lines 405 463) the Hoare annotation is: true [2020-11-07 02:19:51,495 INFO L262 CegarLoopResult]: At program point L407(line 407) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 02:19:51,495 INFO L262 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,495 INFO L262 CegarLoopResult]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,496 INFO L262 CegarLoopResult]: At program point L428(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,496 INFO L262 CegarLoopResult]: At program point L428-1(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,496 INFO L262 CegarLoopResult]: At program point L424(line 424) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2020-11-07 02:19:51,496 INFO L262 CegarLoopResult]: At program point L424-1(line 424) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,496 INFO L262 CegarLoopResult]: At program point L420-1(lines 417 457) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2020-11-07 02:19:51,497 INFO L262 CegarLoopResult]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 02:19:51,497 INFO L262 CegarLoopResult]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (= ~t1_st~0 0)) (.cse1 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse1 (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and (<= 2 ~m_st~0) .cse0 (= ~M_E~0 2) .cse1) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,497 INFO L262 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 02:19:51,497 INFO L262 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-11-07 02:19:51,497 INFO L262 CegarLoopResult]: At program point L408(line 408) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 02:19:51,498 INFO L262 CegarLoopResult]: At program point L437(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,498 INFO L262 CegarLoopResult]: At program point L437-1(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,498 INFO L262 CegarLoopResult]: At program point L437-2(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,498 INFO L262 CegarLoopResult]: At program point L433(line 433) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,498 INFO L269 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-11-07 02:19:51,499 INFO L262 CegarLoopResult]: At program point L421(line 421) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2020-11-07 02:19:51,499 INFO L262 CegarLoopResult]: At program point L450(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,499 INFO L262 CegarLoopResult]: At program point L450-1(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,499 INFO L262 CegarLoopResult]: At program point L450-2(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,500 INFO L262 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 02:19:51,500 INFO L262 CegarLoopResult]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 02:19:51,500 INFO L262 CegarLoopResult]: At program point L442(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-11-07 02:19:51,500 INFO L262 CegarLoopResult]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,500 INFO L262 CegarLoopResult]: At program point L434(line 434) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,501 INFO L262 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 .cse4 (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse4 .cse3 (= ~E_M~0 |old(~E_M~0)|)))) [2020-11-07 02:19:51,501 INFO L262 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,501 INFO L262 CegarLoopResult]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 02:19:51,501 INFO L262 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,502 INFO L262 CegarLoopResult]: At program point L452(lines 452 456) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-11-07 02:19:51,502 INFO L262 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse5 (= ~t1_st~0 0)) (.cse19 (= ~m_st~0 0))) (let ((.cse11 (= ~E_M~0 1)) (.cse16 (not (= ~M_E~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not .cse19)) (.cse9 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse18 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse21 (not (= ~m_pc~0 0))) (.cse13 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse3 (not (= ~M_E~0 2))) (.cse22 (not (= ~t1_pc~0 0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~t1_i~0 1))) (.cse15 (not .cse5)) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse17 (not (<= ~local~0 ~token~0)))) (and (or (<= 1 is_master_triggered_~__retres1~0) (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (not (<= ~token~0 .cse12))) (.cse4 (not (<= .cse12 ~token~0))) (.cse6 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9))))) (or .cse0 .cse1 .cse13 .cse11 .cse14 .cse7 .cse8 .cse15 .cse16 .cse17 .cse9) (or .cse0 .cse1 .cse13 .cse11 .cse14 .cse7 .cse8 .cse18 .cse16 .cse17 .cse9) (or .cse1 .cse13 .cse3 .cse14 .cse7 .cse8 .cse18 .cse19 .cse20 .cse17) (or .cse21 .cse13 .cse3 .cse22 .cse7 .cse15 .cse20 .cse10 .cse9) (or .cse21 .cse1 .cse3 .cse13 .cse14 .cse7 .cse18 .cse19 .cse20 .cse17) (or .cse21 .cse0 .cse13 .cse7) (or .cse21 .cse13 .cse3 .cse22 .cse14 .cse7 .cse15 .cse19 .cse20 .cse17)))) [2020-11-07 02:19:51,502 INFO L262 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: (let ((.cse2 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse6 (= ~m_st~0 0)) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse12 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse13 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (= ~m_pc~0 1))) (.cse5 (not (= ~t1_st~0 0))) (.cse15 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (not .cse6) .cse11) (or .cse12 .cse9 .cse13 .cse3 .cse4 .cse14 .cse10 .cse15 .cse8 .cse11) (or .cse9 .cse1 .cse3 .cse4 .cse14 .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse12 .cse4) (or .cse12 .cse9 .cse13 .cse3 .cse4 .cse14 .cse5 .cse15 .cse8 .cse11))) [2020-11-07 02:19:51,503 INFO L262 CegarLoopResult]: At program point L117(lines 117 122) the Hoare annotation is: (let ((.cse3 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_st~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse6 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse3 .cse4 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (not .cse6) (not (<= 2 ~E_1~0))) (or .cse0 (not (<= 2 ~m_st~0)) .cse4))) [2020-11-07 02:19:51,503 INFO L262 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 112 130) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 0)) (.cse14 (= ~m_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse20 (not .cse14)) (.cse10 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse7 (not .cse18)) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse14 .cse15 .cse9) (or (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse3))) (and (or .cse0 .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse10) (or .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse20 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse22 .cse2 .cse5 .cse7 .cse15 .cse20 .cse10) (or .cse12 .cse13 .cse22 .cse2 .cse4 .cse5 .cse7 .cse14 .cse15 .cse9) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse14 .cse15 .cse9)))) [2020-11-07 02:19:51,503 INFO L269 CegarLoopResult]: At program point L116(lines 116 125) the Hoare annotation is: true [2020-11-07 02:19:51,503 INFO L262 CegarLoopResult]: At program point L116-2(lines 116 125) the Hoare annotation is: (let ((.cse9 (+ ~local~0 1))) (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (<= ~token~0 .cse9))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= .cse9 ~token~0))) (.cse4 (= ~t1_st~0 0)) (.cse5 (not (= ~E_M~0 1))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8)))) [2020-11-07 02:19:51,504 INFO L262 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 112 130) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 0)) (.cse14 (= ~m_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse20 (not .cse14)) (.cse10 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse7 (not .cse18)) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse14 .cse15 .cse9) (or (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse3))) (and (or .cse0 .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse10) (or .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse20 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse22 .cse2 .cse5 .cse7 .cse15 .cse20 .cse10) (or .cse12 .cse13 .cse22 .cse2 .cse4 .cse5 .cse7 .cse14 .cse15 .cse9) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse14 .cse15 .cse9)))) [2020-11-07 02:19:51,504 INFO L269 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2020-11-07 02:19:51,504 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 02:19:51,504 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-11-07 02:19:51,504 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 02:19:51,504 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 02:19:51,504 INFO L262 CegarLoopResult]: At program point L353(line 353) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-11-07 02:19:51,505 INFO L262 CegarLoopResult]: At program point reset_time_eventsEXIT(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-11-07 02:19:51,505 INFO L262 CegarLoopResult]: At program point L368(line 368) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2020-11-07 02:19:51,505 INFO L262 CegarLoopResult]: At program point L362-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse3 (and .cse1 (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse10) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse10)))) [2020-11-07 02:19:51,505 INFO L262 CegarLoopResult]: At program point L358(line 358) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2020-11-07 02:19:51,506 INFO L262 CegarLoopResult]: At program point L352-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2020-11-07 02:19:51,506 INFO L262 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-11-07 02:19:51,506 INFO L262 CegarLoopResult]: At program point L367-1(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-11-07 02:19:51,506 INFO L262 CegarLoopResult]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse1 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2020-11-07 02:19:51,506 INFO L262 CegarLoopResult]: At program point L357-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse4 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 .cse2) .cse3) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2020-11-07 02:19:51,507 INFO L262 CegarLoopResult]: At program point init_modelFINAL(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,507 INFO L262 CegarLoopResult]: At program point L381(line 381) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,507 INFO L262 CegarLoopResult]: At program point init_modelEXIT(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,507 INFO L262 CegarLoopResult]: At program point init_modelENTRY(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-11-07 02:19:51,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:19:51 BoogieIcfgContainer [2020-11-07 02:19:51,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 02:19:51,618 INFO L168 Benchmark]: Toolchain (without parser) took 264364.49 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 127.4 MB in the beginning and 701.8 MB in the end (delta: -574.5 MB). Peak memory consumption was 951.6 MB. Max. memory is 8.0 GB. [2020-11-07 02:19:51,619 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 02:19:51,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.50 ms. Allocated memory is still 151.0 MB. Free memory was 126.8 MB in the beginning and 114.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 02:19:51,620 INFO L168 Benchmark]: Boogie Preprocessor took 83.90 ms. Allocated memory is still 151.0 MB. Free memory was 114.2 MB in the beginning and 112.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 02:19:51,620 INFO L168 Benchmark]: RCFGBuilder took 1020.43 ms. Allocated memory is still 151.0 MB. Free memory was 112.1 MB in the beginning and 110.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 8.0 GB. [2020-11-07 02:19:51,621 INFO L168 Benchmark]: TraceAbstraction took 262762.16 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 110.1 MB in the beginning and 701.8 MB in the end (delta: -591.7 MB). Peak memory consumption was 932.9 MB. Max. memory is 8.0 GB. [2020-11-07 02:19:51,625 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.21 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 473.50 ms. Allocated memory is still 151.0 MB. Free memory was 126.8 MB in the beginning and 114.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.90 ms. Allocated memory is still 151.0 MB. Free memory was 114.2 MB in the beginning and 112.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1020.43 ms. Allocated memory is still 151.0 MB. Free memory was 112.1 MB in the beginning and 110.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 262762.16 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 110.1 MB in the beginning and 701.8 MB in the end (delta: -591.7 MB). Peak memory consumption was 932.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((1 <= __retres1 || ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1)))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && ((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((!(m_pc == 0) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1))) && (((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(t1_i == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) && (((((((((((__retres1 <= 0 && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || ((((((((2 <= m_st && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && t1_pc == 0) && local <= token)) || (((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && E_M == M_E) && m_st == 0) && !(tmp == 0)) && m_pc == 0) && \old(token) == token)) || (((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && E_M == M_E) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token)) || !(t1_i == 1)) || !(\old(m_pc) == 0)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(t1_st) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1)))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(t1_i == 1)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(m_pc) == 1)) || ((((((((t1_pc == 1 && m_st == \old(m_st)) && E_1 == \old(E_1)) && t1_st == 0) && m_pc == \old(m_pc)) && token <= local) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(m_st))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(t1_i == 1)) || !(2 <= \old(m_st))) && (((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || ((((m_st == \old(m_st) && t1_pc == 1) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || (((((((t1_st == 0 && M_E == 2) && 2 <= E_1) && m_st == 0) && t1_pc == 0) && m_pc == 0) && \old(token) == token) && E_M == \old(E_M))) || !(\old(m_st) == 0)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || (2 <= m_st && m_pc == 0)) || !(\old(E_M) == \old(M_E))) || !(\old(m_pc) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && !(E_M == 1)) && token <= local) && M_E == 2) && m_pc == 1) && 2 <= E_1) && local <= token) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((tmp <= 0 && 1 <= __retres2) && 0 <= tmp) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && (((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0))) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((local + 1 <= token && token <= local + 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((!(t1_pc == 1) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((!(m_pc == 0) || ((((E_M == M_E && m_st == 0) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((m_st == \old(m_st) && E_M == M_E) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((!(m_pc == 0) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (2 <= m_st && (t1_st == 0 || \old(t1_st) == t1_st)))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((t1_pc == 1 && \old(token) + 1 <= token) && (t1_st == 0 || \old(t1_st) == t1_st)) && token <= \old(token) + 1) && E_M == M_E) && m_st == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(m_pc) == 0))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 76]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - ProcedureContractResult [Line: 303]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: (((((((((((t1_st == 0 && m_st == 0) && 1 <= tmp) || ((m_st == 0 && \old(t1_st) == t1_st) && 1 <= tmp)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)))) && ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(E_M == M_E)) || (((tmp <= 0 && 0 < tmp + 1) && m_st == 0) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((!(t1_pc == 1) || !(2 <= \old(t1_st))) || E_M == 1) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && ((((!(m_pc == 0) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && ((((((((((2 <= m_st || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((!(\old(t1_st) == 0) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((((!(M_E == 2) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(m_pc == 1)) || !(local <= token)) || (((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || ((!(E_1 == 1) && t1_st == 0) && m_st == 0)) || !(2 <= \old(t1_st))) || !(token <= local)) || ((t1_st == 0 && m_st == 0) && 1 <= tmp___0)) || \old(m_st) == 0) || (((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1)) || !(E_M == M_E))) && (((((((((((!(m_pc == 0) || ((((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1) && !(m_st == 0))) || !(t1_pc == 1)) || !(M_E == 2)) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= \old(t1_st))) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || ((((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1) && !(m_st == 0))) - ProcedureContractResult [Line: 328]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: ((((((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || (t1_st == 0 && !(m_st == 0))) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token))) && (((t1_st == 0 && m_st == 0) || (m_st == 0 && \old(t1_st) == t1_st)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1))))) && ((((!(m_pc == 0) || (2 <= m_st && t1_st == 0)) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st)))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || t1_st == 0) || !(token <= local)) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 176]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1)) - ProcedureContractResult [Line: 131]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: (((((((((!(t1_pc == 1) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 275]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(local <= token)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == 2)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token))) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 158]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || (m_st == 0 && \old(t1_st) == t1_st)) || (2 <= m_st && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(2 <= E_1) - ProcedureContractResult [Line: 464]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 32]: Procedure Contract for master Derived contract for procedure master: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(m_pc) == 0))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) - ProcedureContractResult [Line: 339]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) && (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) - ProcedureContractResult [Line: 196]: Procedure Contract for eval Derived contract for procedure eval: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - ProcedureContractResult [Line: 386]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || (((tmp <= 0 && 1 <= \result) && 1 <= __retres2) && 0 <= tmp)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1) - ProcedureContractResult [Line: 150]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 247]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == \old(M_E))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token)) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 405]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 112]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: ((((((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && (((!(m_pc == 0) || !(2 <= m_st)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1))) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))) || (1 <= \result && 1 <= __retres1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 348]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(\old(M_E) == 1)) && ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(\old(M_E) == 1)) - ProcedureContractResult [Line: 376]: Procedure Contract for init_model Derived contract for procedure init_model: (((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || t1_i == 1) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) || \old(t1_i) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 97.7s, OverallIterations: 16, TraceHistogramMax: 8, AutomataDifference: 79.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 164.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4482 SDtfs, 25974 SDslu, 2704 SDs, 0 SdLazy, 30699 SolverSat, 9207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 1107 SyntacticMatches, 2 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10451 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6221occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 9419 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 230 LocationsWithAnnotation, 42878 PreInvPairs, 45429 NumberOfFragments, 33090 HoareAnnotationTreeSize, 42878 FomulaSimplifications, 7361043788 FormulaSimplificationTreeSizeReduction, 39.0s HoareSimplificationTime, 230 FomulaSimplificationsInter, 3334021 FormulaSimplificationTreeSizeReductionInter, 124.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...