/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:51:56,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:51:56,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:51:56,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:51:56,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:51:56,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:51:56,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:51:56,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:51:56,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:51:56,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:51:56,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:51:56,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:51:56,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:51:56,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:51:56,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:51:56,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:51:56,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:51:56,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:51:56,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:51:56,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:51:56,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:51:56,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:51:56,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:51:56,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:51:56,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:51:56,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:51:56,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:51:56,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:51:56,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:51:56,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:51:56,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:51:56,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:51:56,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:51:56,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:51:56,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:51:56,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:51:56,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:51:56,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:51:56,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:51:56,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:51:56,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:51:56,323 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 06:51:56,350 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:51:56,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:51:56,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:51:56,356 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:51:56,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:51:56,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:51:56,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:51:56,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:51:56,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:51:56,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:51:56,359 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:51:56,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:51:56,359 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:51:56,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:51:56,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:51:56,361 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:51:56,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:51:56,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:51:56,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:51:56,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:51:56,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:51:56,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:51:56,363 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:51:56,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:51:56,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:51:56,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:51:56,937 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:51:56,937 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:51:56,939 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 06:51:57,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d731c327/dd93f28e4da44a21a9e5656e5a39bbc2/FLAG1ba925f5f [2020-11-07 06:51:57,755 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:51:57,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-11-07 06:51:57,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d731c327/dd93f28e4da44a21a9e5656e5a39bbc2/FLAG1ba925f5f [2020-11-07 06:51:58,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d731c327/dd93f28e4da44a21a9e5656e5a39bbc2 [2020-11-07 06:51:58,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:51:58,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:51:58,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:51:58,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:51:58,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:51:58,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b1c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58, skipping insertion in model container [2020-11-07 06:51:58,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:51:58,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:51:58,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:51:58,623 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:51:58,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:51:58,716 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:51:58,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58 WrapperNode [2020-11-07 06:51:58,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:51:58,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:51:58,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:51:58,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:51:58,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:51:58,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:51:58,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:51:58,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:51:58,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (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 06:51:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:51:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:51:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:51:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-07 06:51:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-07 06:51:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-07 06:51:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-07 06:51:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-07 06:51:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-07 06:51:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-07 06:51:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-07 06:51:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-07 06:51:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-07 06:51:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-07 06:51:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-07 06:51:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-07 06:51:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-07 06:51:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-07 06:51:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-07 06:51:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-07 06:51:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-07 06:51:58,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:51:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:51:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:51:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:51:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:51:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-07 06:51:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-07 06:51:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-07 06:51:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-07 06:51:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:51:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-07 06:51:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-07 06:51:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-07 06:51:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-07 06:51:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-07 06:51:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-07 06:51:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-07 06:51:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-07 06:51:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-07 06:51:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-07 06:51:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-07 06:51:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-07 06:51:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-07 06:51:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:51:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:51:59,752 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:51:59,753 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-07 06:51:59,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:51:59 BoogieIcfgContainer [2020-11-07 06:51:59,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:51:59,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:51:59,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:51:59,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:51:59,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:51:58" (1/3) ... [2020-11-07 06:51:59,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376bcdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:51:59, skipping insertion in model container [2020-11-07 06:51:59,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (2/3) ... [2020-11-07 06:51:59,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376bcdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:51:59, skipping insertion in model container [2020-11-07 06:51:59,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:51:59" (3/3) ... [2020-11-07 06:51:59,767 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-11-07 06:51:59,785 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:51:59,790 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:51:59,806 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:51:59,837 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:51:59,837 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:51:59,837 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:51:59,837 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:51:59,838 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:51:59,838 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:51:59,838 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:51:59,838 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:51:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-11-07 06:51:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-07 06:51:59,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:59,887 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 06:51:59,887 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1506744400, now seen corresponding path program 1 times [2020-11-07 06:51:59,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:59,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1378530363] [2020-11-07 06:51:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,713 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 06:52:00,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1378530363] [2020-11-07 06:52:00,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:00,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:52:00,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089795321] [2020-11-07 06:52:00,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:52:00,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:52:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:52:00,760 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 7 states. [2020-11-07 06:52:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:03,569 INFO L93 Difference]: Finished difference Result 786 states and 1048 transitions. [2020-11-07 06:52:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:52:03,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2020-11-07 06:52:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:03,598 INFO L225 Difference]: With dead ends: 786 [2020-11-07 06:52:03,598 INFO L226 Difference]: Without dead ends: 581 [2020-11-07 06:52:03,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:52:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-11-07 06:52:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 400. [2020-11-07 06:52:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-11-07 06:52:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 484 transitions. [2020-11-07 06:52:03,903 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 484 transitions. Word has length 116 [2020-11-07 06:52:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:03,905 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 484 transitions. [2020-11-07 06:52:03,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:52:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 484 transitions. [2020-11-07 06:52:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 06:52:03,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:03,914 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 06:52:03,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:52:03,914 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash -471057246, now seen corresponding path program 1 times [2020-11-07 06:52:03,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:03,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647555788] [2020-11-07 06:52:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:52:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-07 06:52:04,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647555788] [2020-11-07 06:52:04,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:04,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:04,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257977758] [2020-11-07 06:52:04,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:04,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:04,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:04,617 INFO L87 Difference]: Start difference. First operand 400 states and 484 transitions. Second operand 10 states. [2020-11-07 06:52:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:08,365 INFO L93 Difference]: Finished difference Result 1537 states and 2105 transitions. [2020-11-07 06:52:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:52:08,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2020-11-07 06:52:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:08,381 INFO L225 Difference]: With dead ends: 1537 [2020-11-07 06:52:08,382 INFO L226 Difference]: Without dead ends: 1185 [2020-11-07 06:52:08,386 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 06:52:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-11-07 06:52:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 763. [2020-11-07 06:52:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2020-11-07 06:52:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 961 transitions. [2020-11-07 06:52:08,640 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 961 transitions. Word has length 179 [2020-11-07 06:52:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:08,641 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 961 transitions. [2020-11-07 06:52:08,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 961 transitions. [2020-11-07 06:52:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 06:52:08,648 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:08,648 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 06:52:08,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:52:08,649 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1422926590, now seen corresponding path program 1 times [2020-11-07 06:52:08,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:08,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060333460] [2020-11-07 06:52:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:52:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-07 06:52:09,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060333460] [2020-11-07 06:52:09,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:09,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:52:09,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92929197] [2020-11-07 06:52:09,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:52:09,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:52:09,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:52:09,035 INFO L87 Difference]: Start difference. First operand 763 states and 961 transitions. Second operand 9 states. [2020-11-07 06:52:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:11,284 INFO L93 Difference]: Finished difference Result 1788 states and 2319 transitions. [2020-11-07 06:52:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:52:11,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2020-11-07 06:52:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:11,294 INFO L225 Difference]: With dead ends: 1788 [2020-11-07 06:52:11,295 INFO L226 Difference]: Without dead ends: 1071 [2020-11-07 06:52:11,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-11-07 06:52:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-11-07 06:52:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 757. [2020-11-07 06:52:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2020-11-07 06:52:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 950 transitions. [2020-11-07 06:52:11,471 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 950 transitions. Word has length 179 [2020-11-07 06:52:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:11,471 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 950 transitions. [2020-11-07 06:52:11,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:52:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 950 transitions. [2020-11-07 06:52:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 06:52:11,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:11,477 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 06:52:11,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:52:11,477 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1075147907, now seen corresponding path program 1 times [2020-11-07 06:52:11,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:11,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162229068] [2020-11-07 06:52:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:52:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-07 06:52:11,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162229068] [2020-11-07 06:52:11,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:11,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 06:52:11,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484989168] [2020-11-07 06:52:11,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:52:11,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:11,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:52:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:52:11,864 INFO L87 Difference]: Start difference. First operand 757 states and 950 transitions. Second operand 11 states. [2020-11-07 06:52:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:18,578 INFO L93 Difference]: Finished difference Result 4460 states and 6052 transitions. [2020-11-07 06:52:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 06:52:18,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-11-07 06:52:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:18,608 INFO L225 Difference]: With dead ends: 4460 [2020-11-07 06:52:18,609 INFO L226 Difference]: Without dead ends: 3748 [2020-11-07 06:52:18,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 06:52:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2020-11-07 06:52:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 2960. [2020-11-07 06:52:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2020-11-07 06:52:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3739 transitions. [2020-11-07 06:52:19,271 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3739 transitions. Word has length 184 [2020-11-07 06:52:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:19,273 INFO L481 AbstractCegarLoop]: Abstraction has 2960 states and 3739 transitions. [2020-11-07 06:52:19,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:52:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3739 transitions. [2020-11-07 06:52:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2020-11-07 06:52:19,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:19,285 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-07 06:52:19,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:52:19,285 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1911873357, now seen corresponding path program 1 times [2020-11-07 06:52:19,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:19,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24134418] [2020-11-07 06:52:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:52:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:52:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:52:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2020-11-07 06:52:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2020-11-07 06:52:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2020-11-07 06:52:19,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24134418] [2020-11-07 06:52:19,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:19,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:19,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633463971] [2020-11-07 06:52:19,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:19,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:19,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:19,745 INFO L87 Difference]: Start difference. First operand 2960 states and 3739 transitions. Second operand 10 states. [2020-11-07 06:52:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:22,513 INFO L93 Difference]: Finished difference Result 6119 states and 7746 transitions. [2020-11-07 06:52:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:52:22,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 291 [2020-11-07 06:52:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:22,541 INFO L225 Difference]: With dead ends: 6119 [2020-11-07 06:52:22,541 INFO L226 Difference]: Without dead ends: 3204 [2020-11-07 06:52:22,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:52:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2020-11-07 06:52:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2338. [2020-11-07 06:52:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-11-07 06:52:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 2921 transitions. [2020-11-07 06:52:23,216 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 2921 transitions. Word has length 291 [2020-11-07 06:52:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:23,217 INFO L481 AbstractCegarLoop]: Abstraction has 2338 states and 2921 transitions. [2020-11-07 06:52:23,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2921 transitions. [2020-11-07 06:52:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-11-07 06:52:23,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:23,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:52:23,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:52:23,225 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash -768735448, now seen corresponding path program 1 times [2020-11-07 06:52:23,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:23,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436022506] [2020-11-07 06:52:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:52:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 06:52:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 06:52:23,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436022506] [2020-11-07 06:52:23,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:23,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 06:52:23,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462205422] [2020-11-07 06:52:23,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:52:23,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:52:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:23,778 INFO L87 Difference]: Start difference. First operand 2338 states and 2921 transitions. Second operand 13 states. [2020-11-07 06:52:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:28,510 INFO L93 Difference]: Finished difference Result 6851 states and 8918 transitions. [2020-11-07 06:52:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 06:52:28,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 227 [2020-11-07 06:52:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:28,547 INFO L225 Difference]: With dead ends: 6851 [2020-11-07 06:52:28,547 INFO L226 Difference]: Without dead ends: 4558 [2020-11-07 06:52:28,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=492, Invalid=1400, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 06:52:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-11-07 06:52:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 3562. [2020-11-07 06:52:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3562 states. [2020-11-07 06:52:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 4380 transitions. [2020-11-07 06:52:29,468 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 4380 transitions. Word has length 227 [2020-11-07 06:52:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:29,469 INFO L481 AbstractCegarLoop]: Abstraction has 3562 states and 4380 transitions. [2020-11-07 06:52:29,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:52:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 4380 transitions. [2020-11-07 06:52:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-11-07 06:52:29,480 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:29,480 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, 2, 2, 2, 2, 2, 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] [2020-11-07 06:52:29,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:52:29,481 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash 255942355, now seen corresponding path program 1 times [2020-11-07 06:52:29,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:29,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587585796] [2020-11-07 06:52:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:52:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:52:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 06:52:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2020-11-07 06:52:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-11-07 06:52:29,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587585796] [2020-11-07 06:52:29,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:29,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:52:29,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327207912] [2020-11-07 06:52:29,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:52:29,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:52:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:52:29,961 INFO L87 Difference]: Start difference. First operand 3562 states and 4380 transitions. Second operand 12 states. [2020-11-07 06:52:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:37,436 INFO L93 Difference]: Finished difference Result 7061 states and 8813 transitions. [2020-11-07 06:52:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-11-07 06:52:37,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 256 [2020-11-07 06:52:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:37,474 INFO L225 Difference]: With dead ends: 7061 [2020-11-07 06:52:37,474 INFO L226 Difference]: Without dead ends: 4573 [2020-11-07 06:52:37,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2020-11-07 06:52:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2020-11-07 06:52:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3670. [2020-11-07 06:52:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3670 states. [2020-11-07 06:52:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 4402 transitions. [2020-11-07 06:52:38,277 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 4402 transitions. Word has length 256 [2020-11-07 06:52:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:38,278 INFO L481 AbstractCegarLoop]: Abstraction has 3670 states and 4402 transitions. [2020-11-07 06:52:38,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:52:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 4402 transitions. [2020-11-07 06:52:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-11-07 06:52:38,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:38,288 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:52:38,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:52:38,288 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 205993958, now seen corresponding path program 1 times [2020-11-07 06:52:38,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:38,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498192] [2020-11-07 06:52:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:52:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:52:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-11-07 06:52:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2020-11-07 06:52:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 56 proven. 14 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-11-07 06:52:38,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498192] [2020-11-07 06:52:38,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:38,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:52:38,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056206969] [2020-11-07 06:52:38,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:52:38,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:52:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:38,731 INFO L87 Difference]: Start difference. First operand 3670 states and 4402 transitions. Second operand 13 states. [2020-11-07 06:52:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:44,270 INFO L93 Difference]: Finished difference Result 8393 states and 10440 transitions. [2020-11-07 06:52:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-07 06:52:44,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 261 [2020-11-07 06:52:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:44,302 INFO L225 Difference]: With dead ends: 8393 [2020-11-07 06:52:44,302 INFO L226 Difference]: Without dead ends: 4768 [2020-11-07 06:52:44,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 06:52:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2020-11-07 06:52:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 3854. [2020-11-07 06:52:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3854 states. [2020-11-07 06:52:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 4526 transitions. [2020-11-07 06:52:45,490 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 4526 transitions. Word has length 261 [2020-11-07 06:52:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:45,491 INFO L481 AbstractCegarLoop]: Abstraction has 3854 states and 4526 transitions. [2020-11-07 06:52:45,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:52:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 4526 transitions. [2020-11-07 06:52:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-07 06:52:45,501 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:45,501 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 06:52:45,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:52:45,502 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:45,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1731988670, now seen corresponding path program 1 times [2020-11-07 06:52:45,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:45,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71078547] [2020-11-07 06:52:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:52:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:52:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:52:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 06:52:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-11-07 06:52:45,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71078547] [2020-11-07 06:52:45,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:45,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 06:52:45,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314869581] [2020-11-07 06:52:45,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:52:45,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:52:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:52:45,935 INFO L87 Difference]: Start difference. First operand 3854 states and 4526 transitions. Second operand 17 states. [2020-11-07 06:52:48,707 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-07 06:52:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:56,422 INFO L93 Difference]: Finished difference Result 7986 states and 9852 transitions. [2020-11-07 06:52:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-11-07 06:52:56,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 263 [2020-11-07 06:52:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:56,448 INFO L225 Difference]: With dead ends: 7986 [2020-11-07 06:52:56,448 INFO L226 Difference]: Without dead ends: 4176 [2020-11-07 06:52:56,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3859 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2020-11-07 06:52:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2020-11-07 06:52:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 3226. [2020-11-07 06:52:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3226 states. [2020-11-07 06:52:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 3670 transitions. [2020-11-07 06:52:57,131 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 3670 transitions. Word has length 263 [2020-11-07 06:52:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:57,132 INFO L481 AbstractCegarLoop]: Abstraction has 3226 states and 3670 transitions. [2020-11-07 06:52:57,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:52:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 3670 transitions. [2020-11-07 06:52:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-07 06:52:57,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:57,141 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 06:52:57,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:52:57,141 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash -928461701, now seen corresponding path program 1 times [2020-11-07 06:52:57,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:57,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1695610180] [2020-11-07 06:52:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:52:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:52:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:52:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:52:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 06:52:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-07 06:52:57,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1695610180] [2020-11-07 06:52:57,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:57,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:52:57,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226612799] [2020-11-07 06:52:57,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:52:57,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:52:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:52:57,573 INFO L87 Difference]: Start difference. First operand 3226 states and 3670 transitions. Second operand 12 states. [2020-11-07 06:53:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:02,698 INFO L93 Difference]: Finished difference Result 7204 states and 8288 transitions. [2020-11-07 06:53:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 06:53:02,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 263 [2020-11-07 06:53:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:02,721 INFO L225 Difference]: With dead ends: 7204 [2020-11-07 06:53:02,721 INFO L226 Difference]: Without dead ends: 4550 [2020-11-07 06:53:02,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 06:53:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2020-11-07 06:53:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3811. [2020-11-07 06:53:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3811 states. [2020-11-07 06:53:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 4374 transitions. [2020-11-07 06:53:03,523 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 4374 transitions. Word has length 263 [2020-11-07 06:53:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:03,524 INFO L481 AbstractCegarLoop]: Abstraction has 3811 states and 4374 transitions. [2020-11-07 06:53:03,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:53:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 4374 transitions. [2020-11-07 06:53:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-11-07 06:53:03,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:03,533 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 06:53:03,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:53:03,533 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1796451529, now seen corresponding path program 1 times [2020-11-07 06:53:03,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:03,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416377347] [2020-11-07 06:53:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:53:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:53:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:53:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:53:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 06:53:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-11-07 06:53:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-11-07 06:53:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-11-07 06:53:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2020-11-07 06:53:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-11-07 06:53:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2020-11-07 06:53:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 06:53:03,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416377347] [2020-11-07 06:53:03,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:03,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:53:03,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848220245] [2020-11-07 06:53:03,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:53:03,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:53:03,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:53:03,997 INFO L87 Difference]: Start difference. First operand 3811 states and 4374 transitions. Second operand 13 states. [2020-11-07 06:53:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:07,513 INFO L93 Difference]: Finished difference Result 5671 states and 6493 transitions. [2020-11-07 06:53:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 06:53:07,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2020-11-07 06:53:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:07,526 INFO L225 Difference]: With dead ends: 5671 [2020-11-07 06:53:07,526 INFO L226 Difference]: Without dead ends: 1906 [2020-11-07 06:53:07,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 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 06:53:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2020-11-07 06:53:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1612. [2020-11-07 06:53:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2020-11-07 06:53:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1794 transitions. [2020-11-07 06:53:08,038 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1794 transitions. Word has length 284 [2020-11-07 06:53:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:08,039 INFO L481 AbstractCegarLoop]: Abstraction has 1612 states and 1794 transitions. [2020-11-07 06:53:08,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:53:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1794 transitions. [2020-11-07 06:53:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2020-11-07 06:53:08,044 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:08,044 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 06:53:08,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:53:08,045 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -3043505, now seen corresponding path program 1 times [2020-11-07 06:53:08,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:08,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917220047] [2020-11-07 06:53:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:53:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:53:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:53:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:53:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:53:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:53:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 06:53:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:53:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2020-11-07 06:53:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-11-07 06:53:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 06:53:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2020-11-07 06:53:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 14 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-07 06:53:08,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917220047] [2020-11-07 06:53:08,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:08,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:53:08,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036337869] [2020-11-07 06:53:08,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:53:08,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:53:08,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:53:08,686 INFO L87 Difference]: Start difference. First operand 1612 states and 1794 transitions. Second operand 16 states. [2020-11-07 06:53:08,991 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2020-11-07 06:53:11,220 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-07 06:53:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:14,767 INFO L93 Difference]: Finished difference Result 4097 states and 4823 transitions. [2020-11-07 06:53:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-11-07 06:53:14,767 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 293 [2020-11-07 06:53:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:14,781 INFO L225 Difference]: With dead ends: 4097 [2020-11-07 06:53:14,781 INFO L226 Difference]: Without dead ends: 2535 [2020-11-07 06:53:14,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=896, Invalid=3526, Unknown=0, NotChecked=0, Total=4422 [2020-11-07 06:53:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-11-07 06:53:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2220. [2020-11-07 06:53:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2020-11-07 06:53:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2423 transitions. [2020-11-07 06:53:15,347 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2423 transitions. Word has length 293 [2020-11-07 06:53:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:15,348 INFO L481 AbstractCegarLoop]: Abstraction has 2220 states and 2423 transitions. [2020-11-07 06:53:15,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:53:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2423 transitions. [2020-11-07 06:53:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2020-11-07 06:53:15,356 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:15,357 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, 4, 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] [2020-11-07 06:53:15,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:53:15,357 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1364608588, now seen corresponding path program 1 times [2020-11-07 06:53:15,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:15,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108190301] [2020-11-07 06:53:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:53:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:53:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:53:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:53:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:53:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:53:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 06:53:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:53:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2020-11-07 06:53:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2020-11-07 06:53:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 06:53:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2020-11-07 06:53:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2020-11-07 06:53:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2020-11-07 06:53:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2020-11-07 06:53:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2020-11-07 06:53:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2020-11-07 06:53:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2020-11-07 06:53:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2020-11-07 06:53:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2020-11-07 06:53:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2020-11-07 06:53:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2020-11-07 06:53:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 76 proven. 37 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2020-11-07 06:53:15,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108190301] [2020-11-07 06:53:15,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:15,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:53:15,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123124836] [2020-11-07 06:53:15,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:53:15,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:53:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:53:15,960 INFO L87 Difference]: Start difference. First operand 2220 states and 2423 transitions. Second operand 12 states. [2020-11-07 06:53:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:18,925 INFO L93 Difference]: Finished difference Result 4252 states and 4761 transitions. [2020-11-07 06:53:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 06:53:18,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 436 [2020-11-07 06:53:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:18,937 INFO L225 Difference]: With dead ends: 4252 [2020-11-07 06:53:18,938 INFO L226 Difference]: Without dead ends: 2250 [2020-11-07 06:53:18,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:53:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2020-11-07 06:53:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2012. [2020-11-07 06:53:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2020-11-07 06:53:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2164 transitions. [2020-11-07 06:53:19,407 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2164 transitions. Word has length 436 [2020-11-07 06:53:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:19,407 INFO L481 AbstractCegarLoop]: Abstraction has 2012 states and 2164 transitions. [2020-11-07 06:53:19,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:53:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2164 transitions. [2020-11-07 06:53:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2020-11-07 06:53:19,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:19,415 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 06:53:19,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:53:19,415 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1676985734, now seen corresponding path program 1 times [2020-11-07 06:53:19,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:19,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580320003] [2020-11-07 06:53:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,594 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-07 06:53:19,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:53:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:53:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:53:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:53:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:53:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:53:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 06:53:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:53:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 06:53:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:53:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 06:53:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-11-07 06:53:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 06:53:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-11-07 06:53:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2020-11-07 06:53:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2020-11-07 06:53:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2020-11-07 06:53:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2020-11-07 06:53:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2020-11-07 06:53:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2020-11-07 06:53:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2020-11-07 06:53:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:19,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2020-11-07 06:53:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2020-11-07 06:53:20,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580320003] [2020-11-07 06:53:20,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:53:20,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 06:53:20,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038341622] [2020-11-07 06:53:20,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:53:20,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:53:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:53:20,039 INFO L87 Difference]: Start difference. First operand 2012 states and 2164 transitions. Second operand 12 states. [2020-11-07 06:53:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:22,937 INFO L93 Difference]: Finished difference Result 3650 states and 3923 transitions. [2020-11-07 06:53:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:53:22,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 438 [2020-11-07 06:53:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:22,949 INFO L225 Difference]: With dead ends: 3650 [2020-11-07 06:53:22,949 INFO L226 Difference]: Without dead ends: 1906 [2020-11-07 06:53:22,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 06:53:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2020-11-07 06:53:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1806. [2020-11-07 06:53:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2020-11-07 06:53:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 1915 transitions. [2020-11-07 06:53:23,474 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 1915 transitions. Word has length 438 [2020-11-07 06:53:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:23,474 INFO L481 AbstractCegarLoop]: Abstraction has 1806 states and 1915 transitions. [2020-11-07 06:53:23,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:53:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 1915 transitions. [2020-11-07 06:53:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2020-11-07 06:53:23,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:23,481 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 06:53:23,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:53:23,482 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -318238593, now seen corresponding path program 1 times [2020-11-07 06:53:23,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:23,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88042582] [2020-11-07 06:53:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:53:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:53:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:53:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:53:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:53:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:53:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 06:53:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:53:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 06:53:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:53:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 06:53:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-11-07 06:53:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 06:53:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-11-07 06:53:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2020-11-07 06:53:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2020-11-07 06:53:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2020-11-07 06:53:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-11-07 06:53:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-11-07 06:53:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2020-11-07 06:53:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2020-11-07 06:53:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:23,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2020-11-07 06:53:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2020-11-07 06:53:24,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88042582] [2020-11-07 06:53:24,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:24,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:53:24,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261130519] [2020-11-07 06:53:24,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:53:24,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:24,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:53:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:53:24,066 INFO L87 Difference]: Start difference. First operand 1806 states and 1915 transitions. Second operand 14 states. [2020-11-07 06:53:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:27,139 INFO L93 Difference]: Finished difference Result 3240 states and 3462 transitions. [2020-11-07 06:53:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:53:27,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 439 [2020-11-07 06:53:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:27,150 INFO L225 Difference]: With dead ends: 3240 [2020-11-07 06:53:27,151 INFO L226 Difference]: Without dead ends: 1894 [2020-11-07 06:53:27,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:53:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2020-11-07 06:53:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1800. [2020-11-07 06:53:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-11-07 06:53:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 1903 transitions. [2020-11-07 06:53:27,594 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 1903 transitions. Word has length 439 [2020-11-07 06:53:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:27,594 INFO L481 AbstractCegarLoop]: Abstraction has 1800 states and 1903 transitions. [2020-11-07 06:53:27,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:53:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 1903 transitions. [2020-11-07 06:53:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2020-11-07 06:53:27,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:27,600 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 06:53:27,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:53:27,600 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 784629983, now seen corresponding path program 1 times [2020-11-07 06:53:27,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:27,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1295776247] [2020-11-07 06:53:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:53:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:53:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:53:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:53:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:53:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:53:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 06:53:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:53:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 06:53:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:53:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 06:53:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-11-07 06:53:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:27,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 06:53:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-11-07 06:53:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2020-11-07 06:53:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2020-11-07 06:53:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2020-11-07 06:53:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-11-07 06:53:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-11-07 06:53:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2020-11-07 06:53:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2020-11-07 06:53:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2020-11-07 06:53:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2020-11-07 06:53:28,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1295776247] [2020-11-07 06:53:28,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:28,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 06:53:28,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252841205] [2020-11-07 06:53:28,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 06:53:28,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 06:53:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:53:28,256 INFO L87 Difference]: Start difference. First operand 1800 states and 1903 transitions. Second operand 15 states. [2020-11-07 06:53:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:30,947 INFO L93 Difference]: Finished difference Result 2121 states and 2239 transitions. [2020-11-07 06:53:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 06:53:30,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 439 [2020-11-07 06:53:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:30,950 INFO L225 Difference]: With dead ends: 2121 [2020-11-07 06:53:30,950 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:53:30,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 06:53:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:53:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:53:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:53:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:53:30,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2020-11-07 06:53:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:30,958 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:53:30,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 06:53:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:53:30,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:53:30,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:53:30,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:53:31,742 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2020-11-07 06:53:31,982 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2020-11-07 06:53:32,662 WARN L194 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 121 [2020-11-07 06:53:33,082 WARN L194 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 117 [2020-11-07 06:53:33,548 WARN L194 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-11-07 06:53:34,122 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 118 [2020-11-07 06:53:34,259 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 118 [2020-11-07 06:53:34,487 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 118 [2020-11-07 06:53:34,593 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 118 [2020-11-07 06:53:37,488 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2020-11-07 06:53:37,668 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 110 [2020-11-07 06:53:37,820 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 72 [2020-11-07 06:53:40,709 WARN L194 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 116 [2020-11-07 06:53:40,949 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 130 [2020-11-07 06:53:41,328 WARN L194 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2020-11-07 06:53:42,701 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 116 [2020-11-07 06:53:42,940 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 130 [2020-11-07 06:53:43,182 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2020-11-07 06:53:48,287 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 60 [2020-11-07 06:53:48,589 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 118 [2020-11-07 06:53:48,699 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2020-11-07 06:53:48,820 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2020-11-07 06:53:49,261 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 135 [2020-11-07 06:53:49,419 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 114 [2020-11-07 06:53:49,571 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2020-11-07 06:53:49,765 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2020-11-07 06:53:50,823 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 135 [2020-11-07 06:53:50,981 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 114 [2020-11-07 06:53:51,129 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2020-11-07 06:53:51,317 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2020-11-07 06:53:54,345 WARN L194 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2020-11-07 06:53:54,708 WARN L194 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2020-11-07 06:53:55,918 WARN L194 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2020-11-07 06:53:56,620 WARN L194 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 68 [2020-11-07 06:53:57,192 WARN L194 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 70 [2020-11-07 06:53:58,298 WARN L194 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 178 DAG size of output: 63 [2020-11-07 06:53:58,867 WARN L194 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2020-11-07 06:53:59,064 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2020-11-07 06:53:59,634 WARN L194 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2020-11-07 06:54:00,207 WARN L194 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2020-11-07 06:54:00,380 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:00,665 WARN L194 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-11-07 06:54:01,032 WARN L194 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-11-07 06:54:01,490 WARN L194 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2020-11-07 06:54:02,608 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 109 DAG size of output: 64 [2020-11-07 06:54:03,784 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 112 DAG size of output: 67 [2020-11-07 06:54:04,156 WARN L194 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2020-11-07 06:54:04,533 WARN L194 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2020-11-07 06:54:04,704 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-11-07 06:54:04,852 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2020-11-07 06:54:05,235 WARN L194 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2020-11-07 06:54:05,394 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-11-07 06:54:05,560 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:05,733 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:06,037 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-11-07 06:54:06,207 WARN L194 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:06,461 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-11-07 06:54:06,669 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-11-07 06:54:06,866 WARN L194 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-11-07 06:54:07,990 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2020-11-07 06:54:08,239 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-07 06:54:08,913 WARN L194 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2020-11-07 06:54:09,554 WARN L194 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 63 [2020-11-07 06:54:09,945 WARN L194 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2020-11-07 06:54:10,291 WARN L194 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2020-11-07 06:54:10,465 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-11-07 06:54:10,749 WARN L194 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-11-07 06:54:11,293 WARN L194 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2020-11-07 06:54:11,934 WARN L194 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2020-11-07 06:54:12,238 WARN L194 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:54:12,834 WARN L194 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 06:54:13,184 WARN L194 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 58 [2020-11-07 06:54:13,652 WARN L194 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2020-11-07 06:54:14,202 WARN L194 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2020-11-07 06:54:16,058 WARN L194 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2020-11-07 06:54:16,367 WARN L194 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2020-11-07 06:54:16,544 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:16,719 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:17,063 WARN L194 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2020-11-07 06:54:17,239 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:18,986 WARN L194 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2020-11-07 06:54:20,213 WARN L194 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2020-11-07 06:54:21,391 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2020-11-07 06:54:21,767 WARN L194 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 51 [2020-11-07 06:54:22,848 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2020-11-07 06:54:23,941 WARN L194 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 182 DAG size of output: 66 [2020-11-07 06:54:24,085 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-07 06:54:25,480 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 122 DAG size of output: 79 [2020-11-07 06:54:26,760 WARN L194 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 118 DAG size of output: 75 [2020-11-07 06:54:27,007 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-07 06:54:28,308 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 118 DAG size of output: 75 [2020-11-07 06:54:28,719 WARN L194 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2020-11-07 06:54:29,213 WARN L194 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2020-11-07 06:54:29,332 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2020-11-07 06:54:29,576 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2020-11-07 06:54:29,808 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-07 06:54:29,966 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-11-07 06:54:30,148 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-11-07 06:54:30,317 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:30,486 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:30,660 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-11-07 06:54:30,948 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-07 06:54:32,005 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 182 DAG size of output: 66 [2020-11-07 06:54:32,379 WARN L194 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2020-11-07 06:54:32,562 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-11-07 06:54:32,865 WARN L194 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2020-11-07 06:54:33,155 WARN L194 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2020-11-07 06:54:33,549 WARN L194 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2020-11-07 06:54:34,102 WARN L194 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 06:54:34,246 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-11-07 06:54:34,545 WARN L194 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:54:34,980 WARN L194 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2020-11-07 06:54:35,352 WARN L194 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 49 [2020-11-07 06:54:35,647 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-11-07 06:54:35,774 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-07 06:54:36,062 WARN L194 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:54:36,363 WARN L194 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:54:36,611 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-07 06:54:38,870 WARN L194 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2020-11-07 06:54:39,349 WARN L194 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2020-11-07 06:54:41,031 WARN L194 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 147 DAG size of output: 90 [2020-11-07 06:54:41,253 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-11-07 06:54:41,414 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-11-07 06:54:41,753 WARN L194 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-11-07 06:54:42,469 WARN L194 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 68 [2020-11-07 06:54:42,899 WARN L194 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2020-11-07 06:54:43,165 WARN L194 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-07 06:54:43,522 WARN L194 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 58 [2020-11-07 06:54:44,044 WARN L194 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2020-11-07 06:54:44,492 WARN L194 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2020-11-07 06:54:44,974 WARN L194 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2020-11-07 06:54:46,285 WARN L194 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2020-11-07 06:54:46,551 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-11-07 06:54:46,743 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-11-07 06:54:47,003 WARN L194 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2020-11-07 06:54:47,113 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-11-07 06:54:47,214 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2020-11-07 06:54:48,890 WARN L194 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 147 DAG size of output: 90 [2020-11-07 06:54:49,046 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-11-07 06:54:49,723 WARN L194 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2020-11-07 06:54:50,214 WARN L194 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2020-11-07 06:54:51,405 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2020-11-07 06:54:51,882 WARN L194 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2020-11-07 06:54:52,202 WARN L194 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:54:52,395 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-11-07 06:54:52,756 WARN L194 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2020-11-07 06:54:53,325 WARN L194 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 06:54:53,646 WARN L194 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-11-07 06:54:54,203 WARN L194 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 06:54:54,385 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-11-07 06:54:54,674 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-11-07 06:54:54,820 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2020-11-07 06:54:55,011 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-11-07 06:54:55,283 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-11-07 06:54:55,442 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-11-07 06:54:55,701 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:54:55,960 WARN L194 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-07 06:54:56,723 WARN L194 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 64 [2020-11-07 06:54:57,156 WARN L194 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2020-11-07 06:54:57,633 WARN L194 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:54:58,261 WARN L194 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2020-11-07 06:54:58,675 WARN L194 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2020-11-07 06:54:59,653 WARN L194 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 66 [2020-11-07 06:55:00,083 WARN L194 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2020-11-07 06:55:00,241 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-11-07 06:55:00,382 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2020-11-07 06:55:00,924 WARN L194 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2020-11-07 06:55:03,162 WARN L194 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 141 DAG size of output: 87 [2020-11-07 06:55:05,026 WARN L194 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2020-11-07 06:55:05,475 WARN L194 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:55:06,064 WARN L194 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 06:55:06,200 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2020-11-07 06:55:07,133 WARN L194 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 66 [2020-11-07 06:55:07,416 WARN L194 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-11-07 06:55:07,697 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-11-07 06:55:10,012 WARN L194 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 141 DAG size of output: 87 [2020-11-07 06:55:10,309 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-11-07 06:55:10,591 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-11-07 06:55:10,708 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2020-11-07 06:55:11,115 WARN L194 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2020-11-07 06:55:11,288 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-11-07 06:55:11,561 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-11-07 06:55:11,817 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 47 [2020-11-07 06:55:11,988 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-11-07 06:55:12,108 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2020-11-07 06:55:13,333 WARN L194 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2020-11-07 06:55:13,488 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-11-07 06:55:13,642 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-11-07 06:55:13,855 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2020-11-07 06:55:14,512 WARN L194 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 62 [2020-11-07 06:55:14,686 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-11-07 06:55:15,927 WARN L194 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 112 DAG size of output: 67 [2020-11-07 06:55:16,291 WARN L194 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2020-11-07 06:55:16,885 WARN L194 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 70 [2020-11-07 06:55:17,253 WARN L194 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 41 [2020-11-07 06:55:17,609 WARN L194 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2020-11-07 06:55:18,904 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 119 DAG size of output: 76 [2020-11-07 06:55:19,161 WARN L194 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2020-11-07 06:55:20,835 WARN L194 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2020-11-07 06:55:21,308 WARN L194 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2020-11-07 06:55:21,704 WARN L194 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2020-11-07 06:55:21,711 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 06:55:21,712 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 06:55:21,712 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 06:55:21,712 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 06:55:21,713 INFO L262 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse19 (= ~m_st~0 0)) (.cse11 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (let ((.cse20 (+ |old(~token~0)| 1))) (let ((.cse16 (= ~t1_pc~0 1)) (.cse17 (<= .cse20 ~token~0)) (.cse18 (<= ~token~0 .cse20))) (or .cse1 .cse2 (not (= |old(~t1_pc~0)| 1)) .cse7 .cse6 .cse8 (and .cse16 .cse17 (or (= ~t1_st~0 0) .cse12) .cse10 .cse18 .cse19) .cse0 (= |old(~E_M~0)| 1) .cse4 (and .cse9 .cse16 .cse17 .cse10 .cse18 .cse12) .cse14 .cse15))) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 (and .cse10 .cse19 .cse11 .cse12 .cse13) .cse15))) [2020-11-07 06:55:21,713 INFO L262 CegarLoopResult]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse7 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 (and (= ~t1_pc~0 1) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 1)) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-11-07 06:55:21,714 INFO L262 CegarLoopResult]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~t1_pc~0 0)) (.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= ~M_E~0 2))) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or (not (= ~m_pc~0 0)) .cse0 (and .cse10 (= ~m_st~0 0) .cse11 .cse12 .cse13) .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse15) (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 (and (= ~t1_pc~0 1) .cse9 .cse12 (= ~E_M~0 |old(~E_M~0)|) .cse13) (not (= |old(~t1_pc~0)| 1)) .cse4 .cse7 .cse6 .cse8 .cse14 .cse15))) [2020-11-07 06:55:21,714 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 (not (= |old(~t1_pc~0)| 1)) .cse4 .cse6 .cse7 .cse8 .cse9 (let ((.cse11 (+ |old(~token~0)| 1))) (and (= ~m_st~0 |old(~m_st~0)|) (= ~t1_pc~0 1) (<= .cse11 ~token~0) (<= ~token~0 .cse11) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|))) .cse10) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse7 .cse10))) [2020-11-07 06:55:21,714 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse18 (= ~m_st~0 0)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (let ((.cse19 (+ |old(~token~0)| 1))) (let ((.cse16 (<= .cse19 ~token~0)) (.cse17 (<= ~token~0 .cse19))) (or .cse1 .cse2 (not (= |old(~t1_pc~0)| 1)) .cse7 .cse6 .cse8 (and .cse9 .cse16 (or (= ~t1_st~0 0) .cse12) .cse11 .cse17 .cse18) .cse0 (= |old(~E_M~0)| 1) .cse4 (and .cse10 .cse9 .cse16 .cse11 .cse17 .cse12) .cse14 .cse15))) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 (and .cse9 .cse11 .cse18 .cse12 .cse13) .cse15))) [2020-11-07 06:55:21,715 INFO L262 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse19 (= ~m_st~0 0)) (.cse11 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (let ((.cse20 (+ |old(~token~0)| 1))) (let ((.cse16 (= ~t1_pc~0 1)) (.cse17 (<= .cse20 ~token~0)) (.cse18 (<= ~token~0 .cse20))) (or .cse1 .cse2 (not (= |old(~t1_pc~0)| 1)) .cse7 .cse6 .cse8 (and .cse16 .cse17 (or (= ~t1_st~0 0) .cse12) .cse10 .cse18 .cse19) .cse0 (= |old(~E_M~0)| 1) .cse4 (and .cse9 .cse16 .cse17 .cse10 .cse18 .cse12) .cse14 .cse15))) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 (and .cse10 .cse19 .cse11 .cse12 .cse13) .cse15))) [2020-11-07 06:55:21,715 INFO L262 CegarLoopResult]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse7 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 (and (= ~t1_pc~0 1) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 1)) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-11-07 06:55:21,715 INFO L262 CegarLoopResult]: At program point transmit1EXIT(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (not (= ~m_pc~0 1))) (.cse8 (<= 2 ~m_st~0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= ~m_i~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse17 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse18 (not (= |old(~t1_pc~0)| 0))) (.cse3 (not (= ~t1_i~0 1))) (.cse7 (<= 2 ~t1_st~0)) (.cse9 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_st~0 0)) (.cse19 (= |old(~token~0)| ~token~0)) (.cse15 (not (<= 2 ~E_1~0)))) (and (let ((.cse16 (+ |old(~token~0)| 1))) (let ((.cse10 (<= .cse16 ~token~0)) (.cse12 (<= ~token~0 .cse16))) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse2 .cse3 .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) (or .cse5 .cse0 .cse1 .cse17 .cse6 .cse18 .cse3 .cse2 .cse4 (and .cse7 .cse8 .cse9 .cse11 .cse19) .cse14 .cse15) (or (not (= ~m_pc~0 0)) .cse5 .cse1 (not (= |old(~m_st~0)| 0)) .cse17 .cse6 .cse18 .cse3 (and .cse7 .cse9 .cse11 .cse13 .cse19) .cse15))) [2020-11-07 06:55:21,716 INFO L262 CegarLoopResult]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (not (= ~m_pc~0 1))) (.cse8 (<= 2 ~m_st~0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= ~m_i~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse17 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse18 (not (= |old(~t1_pc~0)| 0))) (.cse3 (not (= ~t1_i~0 1))) (.cse7 (<= 2 ~t1_st~0)) (.cse9 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_st~0 0)) (.cse19 (= |old(~token~0)| ~token~0)) (.cse15 (not (<= 2 ~E_1~0)))) (and (let ((.cse16 (+ |old(~token~0)| 1))) (let ((.cse10 (<= .cse16 ~token~0)) (.cse12 (<= ~token~0 .cse16))) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse2 .cse3 .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) (or .cse5 .cse0 .cse1 .cse17 .cse6 .cse18 .cse3 .cse2 .cse4 (and .cse7 .cse8 .cse9 .cse11 .cse19) .cse14 .cse15) (or (not (= ~m_pc~0 0)) .cse5 .cse1 (not (= |old(~m_st~0)| 0)) .cse17 .cse6 .cse18 .cse3 (and .cse7 .cse9 .cse11 .cse13 .cse19) .cse15))) [2020-11-07 06:55:21,716 INFO L262 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse7 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 (not (= |old(~t1_pc~0)| 1)) .cse4 .cse6 .cse7 .cse8 .cse9 (let ((.cse11 (+ |old(~token~0)| 1))) (and (= ~m_st~0 |old(~m_st~0)|) (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse11 ~token~0) (<= ~token~0 .cse11) (= |old(~t1_st~0)| ~t1_st~0))) .cse10))) [2020-11-07 06:55:21,717 INFO L262 CegarLoopResult]: At program point L101-1(line 101) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse16 (+ |old(~token~0)| 1))) (let ((.cse11 (= ~t1_pc~0 1)) (.cse12 (= ~E_M~0 1)) (.cse13 (<= .cse16 ~token~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (<= ~token~0 .cse16))) (or .cse1 .cse2 (not (= |old(~t1_pc~0)| 1)) .cse6 .cse7 .cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse11 .cse12 .cse13 .cse14 .cse15) .cse0 (= |old(~E_M~0)| 1) .cse4 (and .cse11 .cse12 .cse13 (or (= ~t1_st~0 0) .cse15) .cse14 (= ~m_st~0 0)) .cse9 .cse10))) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse7 .cse10))) [2020-11-07 06:55:21,717 INFO L262 CegarLoopResult]: At program point immediate_notifyEXIT(lines 328 338) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (= ~t1_st~0 0)) (.cse5 (and .cse18 (not (= ~E_1~0 1)) .cse17)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (= |old(~m_st~0)| 0)) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (<= ~local~0 ~token~0))) (.cse3 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse15 (and .cse18 .cse17)) (.cse13 (not (= ~m_pc~0 1))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse14 (= |old(~t1_st~0)| 0)) (.cse9 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 (not .cse9)) .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12) (or .cse0 .cse1 (not .cse14) .cse3 (not (= ~t1_pc~0 0)) .cse6 .cse7 .cse10 .cse15 .cse11 .cse12) (let ((.cse16 (+ ~local~0 1))) (or .cse3 (not (<= ~token~0 .cse16)) (not (= ~E_M~0 1)) .cse10 .cse15 .cse13 .cse1 .cse2 (not (<= .cse16 ~token~0)) .cse14 (and .cse9 .cse17) (not (<= 2 |old(~m_st~0)|)) (not (<= 2 ~E_1~0))))))) [2020-11-07 06:55:21,717 INFO L262 CegarLoopResult]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= ~token~0 ~local~0))) (.cse11 (= |old(~m_st~0)| 0)) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse12 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (<= ~local~0 ~token~0)))) (and (let ((.cse3 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse3)) (not (<= .cse3 ~token~0)) .cse4 (not (= ~E_M~0 1)) .cse5 .cse6 .cse7 (not (<= 2 |old(~m_st~0)|)) (not (<= 2 ~E_1~0)))) (or .cse8 .cse0 .cse1 .cse2 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse9 .cse10 .cse11 .cse5 .cse6 .cse7 .cse12 .cse13) (or .cse8 .cse0 (not .cse4) .cse2 (not (= ~t1_pc~0 0)) .cse10 .cse11 .cse6 .cse5 .cse12 .cse13))) [2020-11-07 06:55:21,718 INFO L262 CegarLoopResult]: At program point immediate_notifyFINAL(lines 328 338) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (= ~t1_st~0 0)) (.cse5 (and .cse18 (not (= ~E_1~0 1)) .cse17)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (= |old(~m_st~0)| 0)) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (<= ~local~0 ~token~0))) (.cse3 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse15 (and .cse18 .cse17)) (.cse13 (not (= ~m_pc~0 1))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse14 (= |old(~t1_st~0)| 0)) (.cse9 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 (not .cse9)) .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12) (or .cse0 .cse1 (not .cse14) .cse3 (not (= ~t1_pc~0 0)) .cse6 .cse7 .cse10 .cse15 .cse11 .cse12) (let ((.cse16 (+ ~local~0 1))) (or .cse3 (not (<= ~token~0 .cse16)) (not (= ~E_M~0 1)) .cse10 .cse15 .cse13 .cse1 .cse2 (not (<= .cse16 ~token~0)) .cse14 (and .cse9 .cse17) (not (<= 2 |old(~m_st~0)|)) (not (<= 2 ~E_1~0))))))) [2020-11-07 06:55:21,718 INFO L262 CegarLoopResult]: At program point L320(line 320) the Hoare annotation is: (let ((.cse19 (= |old(~t1_st~0)| 0)) (.cse21 (+ ~local~0 1))) (let ((.cse17 (not (<= ~token~0 .cse21))) (.cse18 (not (<= .cse21 ~token~0))) (.cse11 (= ~E_M~0 1)) (.cse14 (not (= ~M_E~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0))) (.cse2 (not .cse19)) (.cse5 (not (= ~t1_pc~0 0))) (.cse13 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse9 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse20 (and (= ~m_st~0 |old(~m_st~0)|) (<= activate_threads_~tmp~1 0) (<= 1 activate_threads_~tmp___0~0) (< 0 (+ activate_threads_~tmp~1 1)) (= |old(~t1_st~0)| ~t1_st~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse15 .cse16 .cse8) (or .cse1 .cse9 .cse3 .cse17 .cse10 .cse18 .cse6 .cse13 .cse7 .cse16 .cse8) (or .cse1 .cse9 .cse3 .cse17 .cse18 .cse19 (not .cse11) .cse6 .cse13 .cse16 .cse8) (or .cse1 .cse9 .cse17 .cse10 .cse18 .cse11 .cse6 .cse13 .cse14 .cse16 .cse8) (or .cse1 .cse9 .cse3 .cse10 .cse12 .cse6 .cse13 .cse7 .cse15 .cse16 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse4 .cse6 .cse7 .cse15) (or .cse1 .cse9 .cse3 .cse20 .cse10 .cse12 .cse4 .cse6 .cse13 .cse7 .cse15) (or .cse0 .cse1 .cse9 .cse3 .cse20 .cse10 .cse12 .cse4 .cse6 .cse7 .cse15)))) [2020-11-07 06:55:21,718 INFO L262 CegarLoopResult]: At program point L319(lines 319 323) the Hoare annotation is: (let ((.cse10 (<= activate_threads_~tmp___0~0 0)) (.cse29 (+ ~local~0 1)) (.cse12 (<= 0 activate_threads_~tmp___0~0)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= activate_threads_~tmp~1 0)) (.cse27 (< 0 (+ activate_threads_~tmp~1 1))) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= |old(~t1_st~0)| 0))) (let ((.cse16 (not (= ~m_pc~0 0))) (.cse17 (not .cse9)) (.cse18 (not (= ~t1_pc~0 0))) (.cse11 (= ~m_st~0 0)) (.cse0 (not (= ~M_E~0 2))) (.cse23 (and .cse30 .cse26 (<= 1 activate_threads_~tmp___0~0) .cse27 .cse13)) (.cse20 (= |old(~m_st~0)| 0)) (.cse25 (and .cse30 (not (= ~E_1~0 1)) .cse26 .cse27 .cse12 .cse13)) (.cse21 (not (= ~E_M~0 ~M_E~0))) (.cse19 (not (<= ~token~0 ~local~0))) (.cse22 (not (<= ~local~0 ~token~0))) (.cse6 (not (= ~m_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse1 (not (<= ~token~0 .cse29))) (.cse2 (and .cse10 .cse30 .cse26 .cse27 .cse12 .cse13)) (.cse24 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (<= .cse29 ~token~0))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse28 (not (= ~M_E~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or .cse16 .cse6 .cse17 .cse0 .cse2 .cse18 .cse19 .cse20 .cse4 .cse21 .cse22) (or .cse16 .cse6 .cse7 .cse0 .cse23 .cse24 .cse19 .cse20 .cse4 .cse25 .cse21 .cse22) (or .cse16 .cse6 .cse17 .cse0 (not .cse20) .cse18 (and .cse10 .cse26 .cse27 .cse11 .cse12 .cse13) .cse4 .cse21 .cse15) (or .cse10 .cse6 .cse7 .cse0 .cse24 .cse19 .cse4 .cse5 .cse21 .cse22 .cse14 .cse15) (or .cse6 .cse7 .cse0 .cse1 .cse2 .cse24 .cse8 .cse4 .cse5 .cse21 .cse14 .cse15) (or .cse6 .cse7 .cse0 .cse23 .cse24 .cse19 .cse20 .cse4 .cse25 .cse5 .cse21 .cse22) (or .cse6 .cse7 .cse2 .cse24 .cse3 .cse19 .cse4 .cse5 .cse28 .cse22 .cse14 .cse15) (or .cse6 .cse7 .cse1 .cse2 .cse24 .cse8 .cse3 .cse4 .cse5 .cse28 .cse14 .cse15)))) [2020-11-07 06:55:21,719 INFO L262 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (<= 0 |activate_threads_#t~ret12|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (<= |activate_threads_#t~ret12| 0)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (+ ~local~0 1)) (.cse28 (= |old(~t1_st~0)| 0))) (let ((.cse13 (not .cse28)) (.cse14 (not (= ~t1_pc~0 0))) (.cse27 (not (= ~M_E~0 1))) (.cse16 (not (<= ~token~0 .cse30))) (.cse26 (= ~E_M~0 1)) (.cse15 (and .cse29 .cse20 .cse21 .cse22 .cse23 .cse25)) (.cse17 (not (<= .cse30 ~token~0))) (.cse24 (= ~m_st~0 0)) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (and .cse29 .cse21 (<= 1 |activate_threads_#t~ret12|) .cse23 .cse25)) (.cse5 (and .cse29 .cse20 (not (= ~E_1~0 1)) .cse21 .cse23 .cse25)) (.cse7 (= |old(~m_st~0)| 0)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse3 .cse14 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11) (or .cse0 .cse2 .cse3 .cse16 .cse4 .cse17 .cse8 .cse9 .cse10 .cse15 .cse18 .cse19) (or .cse12 .cse0 .cse13 .cse3 (not .cse7) .cse14 .cse8 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse10 .cse19) (or .cse0 .cse2 .cse16 .cse4 .cse17 .cse26 .cse8 .cse9 .cse27 .cse15 .cse18 .cse19) (or .cse0 .cse2 .cse4 .cse26 .cse6 .cse8 .cse9 .cse27 .cse15 .cse11 .cse18 .cse19) (or .cse3 .cse16 (not .cse26) .cse8 .cse9 .cse15 .cse0 .cse2 .cse17 .cse28 (and .cse20 .cse22 .cse24 .cse25) .cse18 .cse19) (or .cse12 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse22 .cse10 .cse11 .cse18 .cse19)))) [2020-11-07 06:55:21,719 INFO L262 CegarLoopResult]: At program point L319-2(lines 303 327) the Hoare annotation is: (let ((.cse30 (+ ~local~0 1)) (.cse22 (<= activate_threads_~tmp___0~0 0)) (.cse31 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (<= activate_threads_~tmp~1 0)) (.cse14 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (<= 0 activate_threads_~tmp___0~0)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse27 (not .cse21)) (.cse28 (not (= ~t1_pc~0 0))) (.cse4 (not (= ~M_E~0 2))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse2 (and .cse22 .cse31 (not (= ~E_1~0 1)) .cse12 .cse14 .cse23 .cse24)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse15 (= ~m_st~0 0)) (.cse7 (= |old(~m_st~0)| 0)) (.cse11 (= ~t1_st~0 0)) (.cse13 (<= 1 activate_threads_~tmp___0~0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse1 (not (= ~m_i~0 1))) (.cse3 (not (= ~t1_pc~0 1))) (.cse16 (not (<= ~token~0 .cse30))) (.cse17 (and .cse22 .cse31 .cse12 .cse14 .cse23 .cse24)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (<= .cse30 ~token~0))) (.cse18 (= ~E_M~0 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse19 (not (= ~m_pc~0 1))) (.cse29 (not (= ~M_E~0 1))) (.cse25 (not (<= 2 |old(~m_st~0)|))) (.cse26 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 (not .cse15))) (or .cse4 .cse16 .cse17 (not .cse18) .cse8 .cse19 .cse1 .cse3 .cse20 .cse21 (and .cse22 .cse15 .cse23 .cse24) .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse4 .cse17 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse27 .cse4 (not .cse7) .cse28 (and .cse22 .cse12 .cse14 .cse15 .cse23 .cse24) .cse8 .cse9 .cse26) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse19 .cse9 .cse24 .cse10 .cse25 .cse26) (or .cse1 .cse3 .cse4 .cse16 .cse17 .cse5 .cse20 .cse8 .cse19 .cse9 .cse25 .cse26) (or .cse1 .cse3 .cse17 .cse5 .cse18 .cse6 .cse8 .cse19 .cse29 .cse10 .cse25 .cse26) (or .cse4 .cse8 .cse19 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 (and .cse11 .cse15 .cse13) .cse7 (and .cse11 .cse12 .cse13 .cse14) .cse9) (or .cse1 .cse3 .cse16 .cse17 .cse5 .cse20 .cse18 .cse8 .cse19 .cse29 .cse25 .cse26)))) [2020-11-07 06:55:21,720 INFO L262 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (<= 0 |activate_threads_#t~ret12|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (<= |activate_threads_#t~ret12| 0)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (+ ~local~0 1)) (.cse28 (= |old(~t1_st~0)| 0))) (let ((.cse13 (not .cse28)) (.cse14 (not (= ~t1_pc~0 0))) (.cse27 (not (= ~M_E~0 1))) (.cse16 (not (<= ~token~0 .cse30))) (.cse26 (= ~E_M~0 1)) (.cse15 (and .cse29 .cse20 .cse21 .cse22 .cse23 .cse25)) (.cse17 (not (<= .cse30 ~token~0))) (.cse24 (= ~m_st~0 0)) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (and .cse29 .cse21 (<= 1 |activate_threads_#t~ret12|) .cse23 .cse25)) (.cse5 (and .cse29 .cse20 (not (= ~E_1~0 1)) .cse21 .cse23 .cse25)) (.cse7 (= |old(~m_st~0)| 0)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse3 .cse14 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11) (or .cse0 .cse2 .cse3 .cse16 .cse4 .cse17 .cse8 .cse9 .cse10 .cse15 .cse18 .cse19) (or .cse12 .cse0 .cse13 .cse3 (not .cse7) .cse14 .cse8 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse10 .cse19) (or .cse0 .cse2 .cse16 .cse4 .cse17 .cse26 .cse8 .cse9 .cse27 .cse15 .cse18 .cse19) (or .cse0 .cse2 .cse4 .cse26 .cse6 .cse8 .cse9 .cse27 .cse15 .cse11 .cse18 .cse19) (or .cse3 .cse16 (not .cse26) .cse8 .cse9 .cse15 .cse0 .cse2 .cse17 .cse28 (and .cse20 .cse22 .cse24 .cse25) .cse18 .cse19) (or .cse12 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse22 .cse10 .cse11 .cse18 .cse19)))) [2020-11-07 06:55:21,720 INFO L262 CegarLoopResult]: At program point L317-2(line 317) the Hoare annotation is: (let ((.cse32 (+ ~local~0 1)) (.cse7 (<= activate_threads_~tmp___0~0 0)) (.cse8 (<= 0 |activate_threads_#t~ret12|)) (.cse10 (<= |activate_threads_#t~ret12| 0)) (.cse13 (<= 0 activate_threads_~tmp___0~0)) (.cse31 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (<= activate_threads_~tmp~1 0)) (.cse11 (< 0 (+ activate_threads_~tmp~1 1))) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse28 (= |old(~t1_st~0)| 0))) (let ((.cse2 (not .cse28)) (.cse5 (not (= ~t1_pc~0 0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse29 (and .cse31 .cse9 (<= 1 |activate_threads_#t~ret12|) (<= 1 activate_threads_~tmp___0~0) .cse11 .cse14)) (.cse4 (= |old(~m_st~0)| 0)) (.cse30 (and .cse7 .cse31 .cse8 (not (= ~E_1~0 1)) .cse9 .cse10 .cse11 .cse13 .cse14)) (.cse21 (not (<= ~token~0 .cse32))) (.cse23 (not (<= .cse32 ~token~0))) (.cse24 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse18 (and .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14)) (.cse1 (not (= ~m_i~0 1))) (.cse20 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse22 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse25 (not (= ~m_pc~0 1))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse27 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse17 .cse4 .cse6 .cse18 .cse15 .cse19) (or .cse1 .cse20 .cse21 .cse22 .cse23 .cse24 .cse6 .cse25 .cse26 .cse18 .cse27 .cse16) (or .cse3 .cse21 (not .cse24) .cse6 .cse25 .cse18 .cse1 .cse20 (and .cse7 .cse8 .cse10 .cse12 .cse13 .cse14) .cse23 .cse28 .cse27 .cse16) (or .cse0 .cse1 .cse20 .cse3 .cse29 .cse22 .cse17 .cse4 .cse6 .cse15 .cse19 .cse30) (or .cse1 .cse20 .cse3 .cse29 .cse22 .cse17 .cse4 .cse6 .cse25 .cse15 .cse19 .cse30) (or .cse1 .cse20 .cse3 .cse21 .cse22 .cse23 .cse6 .cse25 .cse18 .cse15 .cse27 .cse16) (or .cse1 .cse20 .cse22 .cse24 .cse17 .cse6 .cse25 .cse26 .cse18 .cse19 .cse27 .cse16) (or .cse1 .cse20 .cse3 .cse22 .cse17 .cse6 .cse25 .cse10 .cse15 .cse19 .cse27 .cse16)))) [2020-11-07 06:55:21,721 INFO L262 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| 0)) (.cse20 (+ ~local~0 1))) (let ((.cse2 (not (= ~t1_pc~0 1))) (.cse13 (not (<= ~token~0 .cse20))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (not (<= .cse20 ~token~0))) (.cse16 (= ~E_M~0 1)) (.cse17 (not (= ~m_pc~0 1))) (.cse19 (not (= ~M_E~0 1))) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse10 (not .cse15)) (.cse3 (not (= ~M_E~0 2))) (.cse11 (not (= ~t1_pc~0 0))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (= |old(~m_st~0)| 0)) (.cse7 (not (= ~t1_i~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 .cse0 .cse1 .cse10 .cse3 (not .cse6) .cse11 .cse7 .cse8 .cse12) (or .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 (not .cse16) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) .cse7 .cse17 .cse18 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9) (or .cse1 .cse2 .cse4 .cse16 .cse5 .cse7 .cse17 .cse19 .cse9 .cse18 .cse12) (or .cse1 .cse2 .cse3 .cse13 .cse4 .cse14 .cse7 .cse17 .cse8 .cse18 .cse12) (or .cse1 .cse2 .cse13 .cse4 .cse14 .cse16 .cse7 .cse17 .cse19 .cse18 .cse12) (or .cse0 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 06:55:21,721 INFO L262 CegarLoopResult]: At program point L311(lines 311 315) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse20 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (<= activate_threads_~tmp~1 0)) (.cse24 (< 0 (+ activate_threads_~tmp~1 1))) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 .cse25))) (.cse5 (not (<= .cse25 ~token~0))) (.cse19 (= ~E_M~0 1)) (.cse7 (not (= ~m_pc~0 1))) (.cse22 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse10 (and .cse20 .cse23 .cse24 .cse21)) (.cse12 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse13 (not .cse18)) (.cse2 (not (= ~M_E~0 2))) (.cse16 (= |old(~m_st~0)| 0)) (.cse14 (not (= ~t1_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse2 .cse14 .cse15 .cse16 .cse6 .cse8 .cse17 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse15 .cse16 .cse6 .cse7 .cse8 .cse17 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse18 (not .cse19) .cse6 (and .cse20 .cse21) .cse7 .cse9 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse22 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse19 .cse15 .cse6 .cse7 .cse22 .cse17 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse1 .cse2 .cse4 .cse15 .cse16 .cse6 .cse8 .cse17 .cse10) (or .cse12 .cse0 .cse13 .cse2 (not .cse16) .cse14 .cse6 .cse8 (and .cse23 .cse24 (= ~m_st~0 0) .cse21) .cse11)))) [2020-11-07 06:55:21,722 INFO L262 CegarLoopResult]: At program point L309(line 309) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (+ ~local~0 1))) (let ((.cse13 (not (<= ~token~0 .cse22))) (.cse14 (not (<= .cse22 ~token~0))) (.cse3 (= ~E_M~0 1)) (.cse8 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) .cse21)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse19 (not .cse15)) (.cse12 (not (= ~M_E~0 2))) (.cse18 (= |old(~m_st~0)| 0)) (.cse20 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 (not .cse3) .cse5 .cse6 .cse7 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse2 .cse14 .cse5 .cse6 .cse7 .cse16 .cse10 .cse11) (or .cse0 .cse1 .cse13 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse17 .cse0 .cse1 .cse12 .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse9) (or .cse0 .cse1 .cse12 .cse2 .cse4 .cse18 .cse5 .cse6 .cse7 .cse16 .cse9) (or .cse17 .cse0 .cse19 .cse12 .cse20 .cse4 .cse18 .cse6 .cse5 .cse16 .cse9) (or .cse17 .cse0 .cse19 .cse12 (not .cse18) .cse20 .cse5 (and (= ~m_st~0 0) .cse21) .cse16 .cse11)))) [2020-11-07 06:55:21,722 INFO L262 CegarLoopResult]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse20 (= |old(~t1_st~0)| 0)) (.cse23 (<= activate_threads_~tmp~1 0)) (.cse24 (< 0 (+ activate_threads_~tmp~1 1))) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 .cse25))) (.cse5 (not (<= .cse25 ~token~0))) (.cse18 (= ~E_M~0 1)) (.cse7 (not (= ~m_pc~0 1))) (.cse19 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse10 (and (= ~m_st~0 |old(~m_st~0)|) .cse23 .cse24 .cse22)) (.cse12 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse13 (not .cse20)) (.cse2 (not (= ~M_E~0 2))) (.cse16 (= |old(~m_st~0)| 0)) (.cse14 (not (= ~t1_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse21 (= ~m_st~0 0)) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse2 .cse14 .cse15 .cse16 .cse6 .cse8 .cse17 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse15 .cse16 .cse6 .cse7 .cse8 .cse17 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11) (or .cse2 .cse3 (not .cse18) .cse6 .cse7 .cse10 .cse0 .cse1 .cse5 .cse20 (and .cse21 .cse22) .cse9 .cse11) (or .cse0 .cse1 .cse4 .cse18 .cse15 .cse6 .cse7 .cse19 .cse17 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse1 .cse2 .cse4 .cse15 .cse16 .cse6 .cse8 .cse17 .cse10) (or .cse12 .cse0 .cse13 .cse2 (not .cse16) .cse14 .cse6 .cse8 (and .cse23 .cse24 .cse21 .cse22) .cse11)))) [2020-11-07 06:55:21,723 INFO L262 CegarLoopResult]: At program point L309-1(line 309) the Hoare annotation is: (let ((.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (<= |activate_threads_#t~ret11| 0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= 0 |activate_threads_#t~ret11|)) (.cse25 (+ ~local~0 1)) (.cse13 (= |old(~t1_st~0)| 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse21 (not .cse13)) (.cse3 (not (= ~M_E~0 2))) (.cse22 (not (= ~t1_pc~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (= |old(~m_st~0)| 0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse11 (not (<= ~token~0 .cse25))) (.cse4 (and .cse15 .cse23 .cse16 .cse24)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= .cse25 ~token~0))) (.cse14 (= ~E_M~0 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse20 (not (= ~M_E~0 1))) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse11 .cse12 .cse13 (not .cse14) .cse8 (and .cse15 .cse16) .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse8 .cse17 .cse20 .cse10 .cse18 .cse19) (or .cse1 .cse2 .cse4 .cse3 .cse11 .cse5 .cse12 .cse8 .cse17 .cse9 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10) (or .cse0 .cse1 .cse21 .cse3 (not .cse7) .cse22 .cse8 .cse9 .cse19 (and (= ~m_st~0 0) .cse23 .cse16 .cse24)) (or .cse0 .cse1 .cse21 .cse3 .cse4 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse4 .cse5 .cse12 .cse14 .cse8 .cse17 .cse20 .cse18 .cse19)))) [2020-11-07 06:55:21,723 INFO L262 CegarLoopResult]: At program point L309-2(line 309) the Hoare annotation is: (let ((.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (<= |activate_threads_#t~ret11| 0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= 0 |activate_threads_#t~ret11|)) (.cse25 (+ ~local~0 1)) (.cse13 (= |old(~t1_st~0)| 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse21 (not .cse13)) (.cse3 (not (= ~M_E~0 2))) (.cse22 (not (= ~t1_pc~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (= |old(~m_st~0)| 0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse11 (not (<= ~token~0 .cse25))) (.cse4 (and .cse15 .cse23 .cse16 .cse24)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= .cse25 ~token~0))) (.cse14 (= ~E_M~0 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse20 (not (= ~M_E~0 1))) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse11 .cse12 .cse13 (not .cse14) .cse8 (and .cse15 .cse16) .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse8 .cse17 .cse20 .cse10 .cse18 .cse19) (or .cse1 .cse2 .cse4 .cse3 .cse11 .cse5 .cse12 .cse8 .cse17 .cse9 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10) (or .cse0 .cse1 .cse21 .cse3 (not .cse7) .cse22 .cse8 .cse9 .cse19 (and (= ~m_st~0 0) .cse23 .cse16 .cse24)) (or .cse0 .cse1 .cse21 .cse3 .cse4 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse4 .cse5 .cse12 .cse14 .cse8 .cse17 .cse20 .cse18 .cse19)))) [2020-11-07 06:55:21,724 INFO L262 CegarLoopResult]: At program point L309-3(line 309) the Hoare annotation is: (let ((.cse19 (= ~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)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (<= 0 |activate_threads_#t~ret11|)) (.cse27 (+ ~local~0 1)) (.cse18 (= |old(~t1_st~0)| 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse21 (not .cse18)) (.cse3 (not (= ~M_E~0 2))) (.cse26 (not (= ~t1_pc~0 0))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (= |old(~m_st~0)| 0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse16 (not (<= ~token~0 .cse27))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (not (<= .cse27 ~token~0))) (.cse12 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse13 (not (= ~M_E~0 1))) (.cse8 (and .cse19 .cse22 .cse23 .cse24 .cse20 .cse25)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse4 .cse12 .cse5 .cse7 .cse11 .cse13 .cse8 .cse10 .cse14 .cse15) (or .cse1 .cse2 .cse3 .cse16 .cse17 .cse18 (not .cse12) .cse7 (and .cse19 .cse20) .cse11 .cse14 .cse15) (or .cse1 .cse2 .cse3 .cse16 .cse4 .cse17 .cse7 .cse11 .cse8 .cse9 .cse14 .cse15) (or .cse0 .cse1 .cse21 (and .cse22 .cse23 (= ~m_st~0 0) .cse24 .cse20 .cse25) .cse3 (not .cse6) .cse26 .cse7 .cse9 .cse15) (or .cse0 .cse1 .cse21 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse16 .cse4 .cse17 .cse12 .cse7 .cse11 .cse13 .cse8 .cse14 .cse15)))) [2020-11-07 06:55:21,724 INFO L262 CegarLoopResult]: At program point L305(line 305) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (+ ~local~0 1))) (let ((.cse13 (not (<= ~token~0 .cse22))) (.cse14 (not (<= .cse22 ~token~0))) (.cse3 (= ~E_M~0 1)) (.cse8 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) .cse21)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse19 (not .cse15)) (.cse12 (not (= ~M_E~0 2))) (.cse18 (= |old(~m_st~0)| 0)) (.cse20 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 (not .cse3) .cse5 .cse6 .cse7 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse2 .cse14 .cse5 .cse6 .cse7 .cse16 .cse10 .cse11) (or .cse0 .cse1 .cse13 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse17 .cse0 .cse1 .cse12 .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse9) (or .cse0 .cse1 .cse12 .cse2 .cse4 .cse18 .cse5 .cse6 .cse7 .cse16 .cse9) (or .cse17 .cse0 .cse19 .cse12 .cse20 .cse4 .cse18 .cse6 .cse5 .cse16 .cse9) (or .cse17 .cse0 .cse19 .cse12 (not .cse18) .cse20 .cse5 (and (= ~m_st~0 0) .cse21) .cse16 .cse11)))) [2020-11-07 06:55:21,724 INFO L262 CegarLoopResult]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (+ ~local~0 1))) (let ((.cse13 (not (<= ~token~0 .cse22))) (.cse14 (not (<= .cse22 ~token~0))) (.cse3 (= ~E_M~0 1)) (.cse8 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) .cse21)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse19 (not .cse15)) (.cse12 (not (= ~M_E~0 2))) (.cse18 (= |old(~m_st~0)| 0)) (.cse20 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 (not .cse3) .cse5 .cse6 .cse7 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse2 .cse14 .cse5 .cse6 .cse7 .cse16 .cse10 .cse11) (or .cse0 .cse1 .cse13 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse17 .cse0 .cse1 .cse12 .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse9) (or .cse0 .cse1 .cse12 .cse2 .cse4 .cse18 .cse5 .cse6 .cse7 .cse16 .cse9) (or .cse17 .cse0 .cse19 .cse12 .cse20 .cse4 .cse18 .cse6 .cse5 .cse16 .cse9) (or .cse17 .cse0 .cse19 .cse12 (not .cse18) .cse20 .cse5 (and (= ~m_st~0 0) .cse21) .cse16 .cse11)))) [2020-11-07 06:55:21,725 INFO L262 CegarLoopResult]: At program point activate_threadsEXIT(lines 303 327) the Hoare annotation is: (let ((.cse30 (+ ~local~0 1)) (.cse22 (<= activate_threads_~tmp___0~0 0)) (.cse31 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (<= activate_threads_~tmp~1 0)) (.cse14 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (<= 0 activate_threads_~tmp___0~0)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse27 (not .cse21)) (.cse28 (not (= ~t1_pc~0 0))) (.cse4 (not (= ~M_E~0 2))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse2 (and .cse22 .cse31 (not (= ~E_1~0 1)) .cse12 .cse14 .cse23 .cse24)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse15 (= ~m_st~0 0)) (.cse7 (= |old(~m_st~0)| 0)) (.cse11 (= ~t1_st~0 0)) (.cse13 (<= 1 activate_threads_~tmp___0~0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse1 (not (= ~m_i~0 1))) (.cse3 (not (= ~t1_pc~0 1))) (.cse16 (not (<= ~token~0 .cse30))) (.cse17 (and .cse22 .cse31 .cse12 .cse14 .cse23 .cse24)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (<= .cse30 ~token~0))) (.cse18 (= ~E_M~0 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse19 (not (= ~m_pc~0 1))) (.cse29 (not (= ~M_E~0 1))) (.cse25 (not (<= 2 |old(~m_st~0)|))) (.cse26 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 (not .cse15))) (or .cse4 .cse16 .cse17 (not .cse18) .cse8 .cse19 .cse1 .cse3 .cse20 .cse21 (and .cse22 .cse15 .cse23 .cse24) .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse4 .cse17 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse27 .cse4 (not .cse7) .cse28 (and .cse22 .cse12 .cse14 .cse15 .cse23 .cse24) .cse8 .cse9 .cse26) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse19 .cse9 .cse24 .cse10 .cse25 .cse26) (or .cse1 .cse3 .cse4 .cse16 .cse17 .cse5 .cse20 .cse8 .cse19 .cse9 .cse25 .cse26) (or .cse1 .cse3 .cse17 .cse5 .cse18 .cse6 .cse8 .cse19 .cse29 .cse10 .cse25 .cse26) (or .cse4 .cse8 .cse19 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 (and .cse11 .cse15 .cse13) .cse7 (and .cse11 .cse12 .cse13 .cse14) .cse9) (or .cse1 .cse3 .cse16 .cse17 .cse5 .cse20 .cse18 .cse8 .cse19 .cse29 .cse25 .cse26)))) [2020-11-07 06:55:21,725 INFO L262 CegarLoopResult]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1))) (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~t1_st~0 0))) (.cse12 (not (= ~m_pc~0 0))) (.cse8 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse18 (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 exists_runnable_thread_~__retres1~2))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse15 (not (<= ~token~0 .cse20))) (.cse16 (not (<= .cse20 ~token~0))) (.cse19 (= ~E_M~0 1)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse17 (not (<= 2 ~t1_st~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse3 .cse13 .cse5 .cse7 .cse8 .cse9 .cse14 .cse11) (or .cse0 .cse1 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse15 .cse16 .cse5 .cse6 .cse17 .cse8 .cse9 .cse14 .cse11) (or .cse12 .cse0 .cse2 .cse3 .cse5 .cse17 .cse8 .cse9 .cse14 .cse11) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse17 .cse10 .cse11) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse19 .cse5 .cse6 .cse17 .cse11)))) [2020-11-07 06:55:21,726 INFO L262 CegarLoopResult]: At program point L191(line 191) the Hoare annotation is: (let ((.cse9 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 0))) (.cse11 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (not (= ~t1_st~0 0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6 .cse13 .cse8) (let ((.cse14 (+ ~local~0 1))) (or .cse1 .cse10 .cse2 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse4 .cse12 .cse15 .cse6 .cse7 .cse8)) (or .cse1 .cse9 .cse2 .cse3 .cse11 .cse4 .cse12 .cse5 .cse6 .cse13 .cse8) (or .cse0 .cse1 .cse10 .cse2 .cse4 .cse15 .cse6 .cse7 .cse8))) [2020-11-07 06:55:21,726 INFO L262 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 176 195) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1))) (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~t1_st~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse12 (not (= ~m_pc~0 0))) (.cse15 (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2))) (.cse1 (not (<= 2 ~m_st~0))) (.cse16 (= ~E_M~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse18 (not (<= ~token~0 .cse20))) (.cse19 (not (<= .cse20 ~token~0))) (.cse5 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse17 (not (<= 2 ~t1_st~0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse3 .cse13 .cse5 .cse6 .cse8 .cse9 .cse14 .cse11) (or .cse0 .cse1 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse17 .cse10 .cse11) (or .cse12 .cse0 .cse2 .cse3 .cse5 .cse6 .cse17 .cse9 .cse14 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse18 .cse19 .cse16 .cse6 .cse7 .cse17 .cse11) (or .cse0 .cse2 .cse3 .cse18 .cse19 .cse5 .cse6 .cse7 .cse17 .cse9 .cse14 .cse11)))) [2020-11-07 06:55:21,726 INFO L262 CegarLoopResult]: At program point L185(line 185) the Hoare annotation is: (let ((.cse14 (+ ~local~0 1))) (let ((.cse7 (not (<= 2 ~m_st~0))) (.cse12 (not (<= ~token~0 .cse14))) (.cse13 (not (<= .cse14 ~token~0))) (.cse9 (= ~E_M~0 1)) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~t1_pc~0 0)) .cse3 (not (= ~t1_st~0 0)) .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse8 .cse2 .cse9 (not (<= ~token~0 ~local~0)) .cse3 .cse10 .cse11 (not (<= ~local~0 ~token~0)) .cse6) (or .cse1 .cse8 .cse2 .cse12 .cse13 .cse3 .cse10 .cse11 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse8 .cse12 .cse2 .cse13 .cse9 .cse3 .cse10 .cse11 .cse6) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6)))) [2020-11-07 06:55:21,727 INFO L262 CegarLoopResult]: At program point L184(lines 184 189) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~t1_pc~0 0)) .cse3 (not (= ~t1_st~0 0)) .cse4 .cse5 .cse6) (let ((.cse8 (+ ~local~0 1))) (or .cse1 .cse7 .cse2 (not (<= ~token~0 .cse8)) (not (<= .cse8 ~token~0)) .cse3 (not (= ~m_pc~0 1)) .cse9 .cse4 .cse5 .cse6)) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6))) [2020-11-07 06:55:21,727 INFO L269 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2020-11-07 06:55:21,727 INFO L262 CegarLoopResult]: At program point L181(line 181) the Hoare annotation is: (let ((.cse2 (not (= ~t1_pc~0 1))) (.cse11 (= ~E_M~0 1)) (.cse12 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~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) (or .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse12 .cse9 .cse10) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse13)) .cse3 (not (<= .cse13 ~token~0)) .cse11 .cse5 .cse6 .cse12 .cse10)) (or .cse0 .cse1 .cse3 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-11-07 06:55:21,727 INFO L269 CegarLoopResult]: At program point L180(lines 180 190) the Hoare annotation is: true [2020-11-07 06:55:21,728 INFO L262 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 176 195) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1))) (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~t1_st~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse12 (not (= ~m_pc~0 0))) (.cse15 (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2))) (.cse1 (not (<= 2 ~m_st~0))) (.cse16 (= ~E_M~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse18 (not (<= ~token~0 .cse20))) (.cse19 (not (<= .cse20 ~token~0))) (.cse5 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse17 (not (<= 2 ~t1_st~0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse3 .cse13 .cse5 .cse6 .cse8 .cse9 .cse14 .cse11) (or .cse0 .cse1 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse17 .cse10 .cse11) (or .cse12 .cse0 .cse2 .cse3 .cse5 .cse6 .cse17 .cse9 .cse14 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse18 .cse19 .cse16 .cse6 .cse7 .cse17 .cse11) (or .cse0 .cse2 .cse3 .cse18 .cse19 .cse5 .cse6 .cse7 .cse17 .cse9 .cse14 .cse11)))) [2020-11-07 06:55:21,728 INFO L262 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 131 149) the Hoare annotation is: (let ((.cse26 (<= 0 is_transmit1_triggered_~__retres1~1)) (.cse27 (<= is_transmit1_triggered_~__retres1~1 0)) (.cse25 (<= |is_transmit1_triggered_#res| 0)) (.cse28 (<= 0 |is_transmit1_triggered_#res|)) (.cse29 (+ ~local~0 1)) (.cse19 (= ~m_st~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse21 (= ~E_M~0 1))) (let ((.cse7 (not .cse21)) (.cse16 (not (= ~t1_pc~0 0))) (.cse18 (not .cse6)) (.cse12 (not .cse19)) (.cse4 (not (<= ~token~0 .cse29))) (.cse5 (not (<= .cse29 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse22 (not (= ~M_E~0 1))) (.cse10 (and .cse26 .cse27 .cse25 .cse28)) (.cse23 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse24 (and .cse26 (not (= ~E_1~0 1)) .cse27 .cse25 .cse28)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse17 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse13 (not (<= 2 ~t1_st~0))) (.cse14 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse13 .cse10 .cse14 .cse11) (or .cse15 .cse0 .cse3 .cse16 .cse17 .cse8 .cse18 .cse10 .cse19 .cse14 .cse20) (or .cse15 .cse0 .cse3 .cse16 .cse8 .cse18 .cse10 .cse14 .cse12 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse8 .cse9 .cse13 .cse22 .cse10 .cse11) (or .cse15 .cse0 .cse2 .cse3 .cse23 .cse17 .cse8 .cse13 .cse24 .cse19 .cse14 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse17 .cse8 .cse9 .cse13 .cse22 .cse10 .cse20 .cse11) (or .cse0 .cse2 .cse3 .cse23 .cse17 .cse8 .cse9 .cse13 .cse24 .cse14 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse8 .cse25 .cse9 .cse13 .cse14 .cse20 .cse11)))) [2020-11-07 06:55:21,728 INFO L269 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2020-11-07 06:55:21,729 INFO L262 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 131 149) the Hoare annotation is: (let ((.cse26 (<= 0 is_transmit1_triggered_~__retres1~1)) (.cse27 (<= is_transmit1_triggered_~__retres1~1 0)) (.cse25 (<= |is_transmit1_triggered_#res| 0)) (.cse28 (<= 0 |is_transmit1_triggered_#res|)) (.cse29 (+ ~local~0 1)) (.cse19 (= ~m_st~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse21 (= ~E_M~0 1))) (let ((.cse7 (not .cse21)) (.cse16 (not (= ~t1_pc~0 0))) (.cse18 (not .cse6)) (.cse12 (not .cse19)) (.cse4 (not (<= ~token~0 .cse29))) (.cse5 (not (<= .cse29 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse22 (not (= ~M_E~0 1))) (.cse10 (and .cse26 .cse27 .cse25 .cse28)) (.cse23 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse24 (and .cse26 (not (= ~E_1~0 1)) .cse27 .cse25 .cse28)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse17 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse13 (not (<= 2 ~t1_st~0))) (.cse14 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse13 .cse10 .cse14 .cse11) (or .cse15 .cse0 .cse3 .cse16 .cse17 .cse8 .cse18 .cse10 .cse19 .cse14 .cse20) (or .cse15 .cse0 .cse3 .cse16 .cse8 .cse18 .cse10 .cse14 .cse12 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse8 .cse9 .cse13 .cse22 .cse10 .cse11) (or .cse15 .cse0 .cse2 .cse3 .cse23 .cse17 .cse8 .cse13 .cse24 .cse19 .cse14 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse17 .cse8 .cse9 .cse13 .cse22 .cse10 .cse20 .cse11) (or .cse0 .cse2 .cse3 .cse23 .cse17 .cse8 .cse9 .cse13 .cse24 .cse14 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse8 .cse25 .cse9 .cse13 .cse14 .cse20 .cse11)))) [2020-11-07 06:55:21,729 INFO L262 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse6 (= ~E_M~0 1)) (.cse22 (<= is_transmit1_triggered_~__retres1~1 0)) (.cse26 (+ ~local~0 1)) (.cse24 (= ~t1_st~0 0)) (.cse23 (= ~m_st~0 0)) (.cse27 (<= 0 is_transmit1_triggered_~__retres1~1))) (let ((.cse18 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse21 (and .cse27 (not (= ~E_1~0 1)))) (.cse10 (not (= ~M_E~0 1))) (.cse17 (not .cse23)) (.cse12 (not (= ~m_pc~0 0))) (.cse14 (not (= ~t1_pc~0 0))) (.cse19 (not (<= ~token~0 ~local~0))) (.cse15 (not .cse24)) (.cse20 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse3 (not (<= ~token~0 .cse26))) (.cse4 (and .cse27 .cse22)) (.cse5 (not (<= .cse26 ~token~0))) (.cse25 (not .cse6)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse4 .cse14 .cse7 .cse15 .cse16 .cse17 .cse11) (or .cse0 .cse2 .cse13 .cse18 .cse19 .cse7 .cse8 .cse9 .cse16 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse13 .cse19 .cse22 .cse7 .cse8 .cse9 .cse16 .cse20 .cse11) (or .cse12 .cse0 .cse2 .cse13 .cse18 .cse19 .cse7 .cse9 .cse23 .cse16 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11) (or .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse24 .cse25 .cse7 .cse8 .cse17 .cse11) (or .cse12 .cse0 .cse13 .cse4 .cse14 .cse19 .cse7 .cse15 .cse23 .cse16 .cse20) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse11) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse24 .cse25 .cse7 .cse8 .cse11)))) [2020-11-07 06:55:21,730 INFO L262 CegarLoopResult]: At program point L137(line 137) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0)) (.cse18 (= ~E_M~0 1)) (.cse22 (+ ~local~0 1)) (.cse20 (= ~t1_st~0 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse3 (not (= ~t1_pc~0 0))) (.cse5 (not .cse20)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse14 (not (<= 2 ~t1_st~0))) (.cse19 (not (= ~M_E~0 1))) (.cse1 (not (= ~m_i~0 1))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse11 (not (<= ~token~0 .cse22))) (.cse12 (not (<= .cse22 ~token~0))) (.cse21 (not .cse18)) (.cse4 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse7 (not .cse16)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse13 .cse14 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse6 .cse17) (or .cse1 .cse9 .cse10 .cse2 .cse15 .cse4 .cse13 .cse14 .cse6 .cse17 .cse8) (or .cse1 .cse9 .cse10 .cse18 .cse15 .cse4 .cse13 .cse14 .cse19 .cse17 .cse8) (or .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse20 .cse21 .cse4 .cse13 .cse8) (or .cse1 .cse9 .cse10 .cse11 .cse12 .cse18 .cse4 .cse13 .cse14 .cse19 .cse8) (or .cse1 .cse10 .cse2 .cse11 .cse12 .cse20 .cse21 .cse4 .cse13 .cse7 .cse8)))) [2020-11-07 06:55:21,730 INFO L262 CegarLoopResult]: At program point L136(lines 136 141) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~t1_st~0 0))) (.cse7 (= ~m_st~0 0)) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) (not (<= 2 ~E_1~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse7 .cse6 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,730 INFO L269 CegarLoopResult]: At program point L135(lines 135 144) the Hoare annotation is: true [2020-11-07 06:55:21,730 INFO L262 CegarLoopResult]: At program point L135-2(lines 135 144) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.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 06:55:21,730 INFO L262 CegarLoopResult]: At program point L289-1(lines 278 301) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (and .cse10 .cse11 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) (and .cse10 (= ~E_M~0 ~M_E~0) .cse11) .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))))) [2020-11-07 06:55:21,731 INFO L262 CegarLoopResult]: At program point L285(line 285) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= 2 |old(~M_E~0)|))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (let ((.cse4 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse4)) (not (<= .cse4 ~token~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse10 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,731 INFO L262 CegarLoopResult]: At program point L279-1(lines 278 301) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= 2 |old(~M_E~0)|))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (let ((.cse4 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse4)) (not (<= .cse4 ~token~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 .cse2 (not (= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse10 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,731 INFO L262 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 .cse3 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse10)) .cse3 (not (<= .cse10 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 06:55:21,732 INFO L262 CegarLoopResult]: At program point L294-1(lines 275 302) the Hoare annotation is: (let ((.cse4 (= ~E_M~0 ~M_E~0)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse11 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) (and .cse3 .cse4 .cse12) .cse6 .cse7 .cse8 .cse11 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) (and .cse3 .cse5 .cse12) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2020-11-07 06:55:21,732 INFO L262 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (or .cse0 .cse5 .cse6 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4)) (or .cse0 .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,732 INFO L262 CegarLoopResult]: At program point L284-1(lines 278 301) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (let ((.cse3 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse3)) (not (<= .cse3 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 (= ~M_E~0 2)))) (or .cse0 .cse1 .cse2 (and .cse10 .cse11 .cse12) (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) (and .cse10 .cse12 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,733 INFO L262 CegarLoopResult]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (or .cse0 .cse5 .cse6 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4)) (or .cse0 .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,733 INFO L262 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 275 302) the Hoare annotation is: (let ((.cse4 (= ~E_M~0 ~M_E~0)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse11 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= ~local~0 ~token~0))) (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) (and .cse3 .cse4 .cse12) .cse6 .cse7 .cse8 .cse11 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) (and .cse3 .cse5 .cse12) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2020-11-07 06:55:21,733 INFO L262 CegarLoopResult]: At program point L295(line 295) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (or .cse0 .cse5 .cse6 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4)) (or .cse0 .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,733 INFO L262 CegarLoopResult]: At program point L162-1(lines 161 174) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (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 06:55:21,733 INFO L262 CegarLoopResult]: At program point init_threadsEXIT(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-11-07 06:55:21,734 INFO L262 CegarLoopResult]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (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 06:55:21,734 INFO L262 CegarLoopResult]: At program point L170(line 170) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (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 06:55:21,734 INFO L262 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (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 06:55:21,734 INFO L262 CegarLoopResult]: At program point L167-1(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-11-07 06:55:21,734 INFO L262 CegarLoopResult]: At program point L165(line 165) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (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 06:55:21,734 INFO L262 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~m_i~0 1)) (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 06:55:21,735 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(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,735 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 464 475) the Hoare annotation is: true [2020-11-07 06:55:21,735 INFO L269 CegarLoopResult]: At program point L473(line 473) the Hoare annotation is: true [2020-11-07 06:55:21,735 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 464 475) the Hoare annotation is: true [2020-11-07 06:55:21,735 INFO L269 CegarLoopResult]: At program point L470(line 470) the Hoare annotation is: true [2020-11-07 06:55:21,735 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(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,736 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)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_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) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~m_i~0 1) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,736 INFO L269 CegarLoopResult]: At program point errorEXIT(lines 8 15) the Hoare annotation is: true [2020-11-07 06:55:21,736 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:55:21,736 INFO L269 CegarLoopResult]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2020-11-07 06:55:21,736 INFO L269 CegarLoopResult]: At program point errorFINAL(lines 8 15) the Hoare annotation is: true [2020-11-07 06:55:21,736 INFO L262 CegarLoopResult]: At program point masterEXIT(lines 32 75) the Hoare annotation is: (let ((.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= ~t1_i~0 1)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (= ~m_pc~0 1)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse19 (= ~M_E~0 2)) (.cse18 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse13 (not .cse18)) (.cse1 (not .cse19)) (.cse14 (and .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10)) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= |old(~m_st~0)| 0)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse20)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse17 (and .cse6 .cse18 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10 .cse11)) (.cse12 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (let ((.cse15 (+ |old(~local~0)| 1))) (or .cse1 .cse4 (not (= |old(~m_pc~0)| 1)) .cse0 .cse13 .cse14 (not (<= |old(~token~0)| .cse15)) .cse16 .cse2 .cse3 .cse5 .cse17 (not (<= .cse15 |old(~token~0)|)))) (or .cse0 .cse13 .cse1 .cse14 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse12)))) [2020-11-07 06:55:21,737 INFO L262 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse21 (= ~m_i~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (= ~t1_pc~0 1)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (= ~m_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~M_E~0 2))) (let ((.cse10 (not (= |old(~m_pc~0)| 0))) (.cse2 (not .cse19)) (.cse5 (and .cse11 .cse18 .cse12 .cse19 .cse13 .cse20 .cse14 .cse15 .cse16)) (.cse7 (not .cse20)) (.cse0 (not .cse21)) (.cse1 (not .cse18)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (and .cse18 (= ~t1_st~0 0) .cse12 .cse19 .cse13 .cse20 .cse14 .cse21 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse6 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse7 .cse8 .cse10) (let ((.cse17 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse7 (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse17)) .cse3 .cse4 .cse6 .cse8 .cse9 (not (<= .cse17 |old(~token~0)|))))))) [2020-11-07 06:55:21,737 INFO L262 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (and .cse11 .cse12 .cse13 .cse14 (= ~m_pc~0 0) .cse15)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse10)) .cse3 (and .cse11 .cse12 .cse13 (= ~m_pc~0 1) .cse14 .cse15) .cse4 .cse5 .cse7 .cse8 (not (<= .cse10 |old(~token~0)|)))) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 06:55:21,737 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse10 (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 (and (= ~local~0 |old(~local~0)|) .cse12 .cse13 (= ~m_pc~0 |old(~m_pc~0)|) .cse14 .cse15)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse8 .cse1 (not (<= |old(~token~0)| .cse9)) .cse10 .cse2 .cse3 .cse4 .cse6 (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse12 .cse13 (= ~m_pc~0 1) .cse14 .cse15)) (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,738 INFO L262 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse12 (and .cse8 .cse9 (= ~m_pc~0 0) .cse10)) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse3 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse3)) .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 (= ~m_pc~0 1) .cse10) .cse11 (not (<= .cse3 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse12 .cse11 .cse13) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse12 .cse11 .cse13)))) [2020-11-07 06:55:21,738 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse10 (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 (and (= ~local~0 |old(~local~0)|) .cse12 .cse13 (= ~m_pc~0 |old(~m_pc~0)|) .cse14 .cse15)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse8 .cse1 (not (<= |old(~token~0)| .cse9)) .cse10 .cse2 .cse3 .cse4 .cse6 (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse12 .cse13 (= ~m_pc~0 1) .cse14 .cse15)) (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,738 INFO L262 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse8 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse9)) .cse3 .cse4 .cse5 .cse6 (let ((.cse10 (+ ~local~0 1))) (and (<= .cse10 ~token~0) (<= ~token~0 .cse10) (= ~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))) .cse7 (not (<= .cse9 |old(~token~0)|)))))) [2020-11-07 06:55:21,739 INFO L262 CegarLoopResult]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= ~t1_i~0 1)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (= ~m_pc~0 1)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse19 (= ~M_E~0 2)) (.cse18 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse13 (not .cse18)) (.cse1 (not .cse19)) (.cse14 (and .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10)) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= |old(~m_st~0)| 0)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse20)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse17 (and .cse6 .cse18 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10 .cse11)) (.cse12 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (let ((.cse15 (+ |old(~local~0)| 1))) (or .cse1 .cse4 (not (= |old(~m_pc~0)| 1)) .cse0 .cse13 .cse14 (not (<= |old(~token~0)| .cse15)) .cse16 .cse2 .cse3 .cse5 .cse17 (not (<= .cse15 |old(~token~0)|)))) (or .cse0 .cse13 .cse1 .cse14 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse12)))) [2020-11-07 06:55:21,739 INFO L262 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse8 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse9)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))))) [2020-11-07 06:55:21,739 INFO L262 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse10 (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 (and (= ~local~0 |old(~local~0)|) .cse12 .cse13 (= ~m_pc~0 |old(~m_pc~0)|) .cse14 .cse15)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse8 .cse1 (not (<= |old(~token~0)| .cse9)) .cse10 .cse2 .cse3 .cse4 .cse6 (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse12 .cse13 (= ~m_pc~0 1) .cse14 .cse15)) (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,740 INFO L262 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (= ~m_pc~0 0)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse3 (= ~M_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= ~t1_st~0 0)) (.cse9 (not .cse6)) (.cse11 (not .cse3)) (.cse13 (= |old(~m_st~0)| 0)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not .cse4)) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse17 (not (= |old(~m_pc~0)| 0))) (.cse18 (and .cse20 .cse2 .cse5 .cse7 .cse8 .cse21))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse19 (+ |old(~local~0)| 1))) (or .cse11 .cse15 (not (= |old(~m_pc~0)| 1)) .cse9 .cse10 (not (<= |old(~token~0)| .cse19)) .cse12 .cse13 (and .cse20 .cse2 .cse5 .cse7 .cse21) .cse14 .cse16 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= .cse19 |old(~token~0)|)))) (or .cse9 (not (= |old(~t1_st~0)| 0)) .cse11 (not (= ~t1_pc~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2020-11-07 06:55:21,740 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse0 (and .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14)) (.cse9 (not (= |old(~m_pc~0)| 0))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 (not (= |old(~t1_st~0)| 0)) .cse0 .cse3 (not (= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse1 .cse2 .cse3 (not (<= |old(~token~0)| .cse10)) .cse4 .cse5 .cse6 .cse7 (and .cse11 .cse12 (= ~m_pc~0 1) .cse13 .cse14) .cse8 (not (<= .cse10 |old(~token~0)|))))))) [2020-11-07 06:55:21,740 INFO L262 CegarLoopResult]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (not (= ~E_1~0 1))) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (not (= ~t1_i~0 1))) (.cse15 (= ~t1_st~0 0)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse0 (not (= ~m_i~0 1))) (.cse12 (not (= ~t1_pc~0 1))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= |old(~m_st~0)| 0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse6 (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5) .cse14 (and .cse15 .cse2 .cse3 .cse4) .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse6 (and .cse1 .cse13 .cse2 .cse3 .cse5) .cse9 (and .cse15 .cse2 .cse3) (not (= |old(~m_pc~0)| 1)) .cse0 .cse12 (not (<= |old(~token~0)| .cse16)) .cse14 .cse7 .cse8 .cse10 (not (<= .cse16 |old(~token~0)|)))))) [2020-11-07 06:55:21,741 INFO L262 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse12 (and .cse8 .cse9 (= ~m_pc~0 0) .cse10)) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse3 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse3)) .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 (= ~m_pc~0 1) .cse10) .cse11 (not (<= .cse3 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse12 .cse11 .cse13) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse12 .cse11 .cse13)))) [2020-11-07 06:55:21,741 INFO L262 CegarLoopResult]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= |old(~token~0)| ~token~0))) (let ((.cse5 (and (= ~local~0 |old(~local~0)|) .cse12 .cse13 .cse14 .cse15 .cse16)) (.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (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))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse10 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse8 .cse1 (not (<= |old(~token~0)| .cse10)) .cse9 .cse2 .cse3 .cse4 (let ((.cse11 (+ ~local~0 1))) (and (<= .cse11 ~token~0) (<= ~token~0 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16)) .cse6 (not (<= .cse10 |old(~token~0)|))))))) [2020-11-07 06:55:21,741 INFO L262 CegarLoopResult]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse8 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse9)) .cse3 .cse4 .cse5 .cse6 (let ((.cse10 (+ ~local~0 1))) (and (<= .cse10 ~token~0) (<= ~token~0 .cse10) (= ~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))) .cse7 (not (<= .cse9 |old(~token~0)|)))))) [2020-11-07 06:55:21,742 INFO L262 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= ~E_M~0 1)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (= ~M_E~0 1)) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) .cse3 (not (<= .cse2 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 (not (<= ~local~0 ~token~0)) .cse9))) [2020-11-07 06:55:21,742 INFO L262 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= ~E_M~0 1)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (= ~M_E~0 |old(~M_E~0)|)) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) .cse3 (not (<= .cse2 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 (not (<= ~local~0 ~token~0)) .cse9))) [2020-11-07 06:55:21,742 INFO L262 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= ~E_M~0 1)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (= ~M_E~0 1)) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) .cse3 (not (<= .cse2 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 (not (<= ~local~0 ~token~0)) .cse9))) [2020-11-07 06:55:21,742 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 06:55:21,743 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 06:55:21,743 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 06:55:21,743 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 06:55:21,743 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,743 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 06:55:21,744 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 06:55:21,744 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,744 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,744 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,744 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,744 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,745 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,745 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,745 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 06:55:21,745 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 06:55:21,745 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 06:55:21,745 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 06:55:21,746 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 06:55:21,746 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 06:55:21,746 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 06:55:21,746 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,746 INFO L262 CegarLoopResult]: At program point stop_simulationFINAL(lines 386 404) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= ~E_M~0 1)) (.cse5 (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 (not (<= ~local~0 ~token~0)) .cse9) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 06:55:21,747 INFO L262 CegarLoopResult]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (and (<= stop_simulation_~tmp~2 0) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 (not (<= ~local~0 ~token~0)) .cse9) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 06:55:21,747 INFO L262 CegarLoopResult]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (<= stop_simulation_~tmp~2 0) (<= 0 stop_simulation_~tmp~2))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (let ((.cse4 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse4)) (not (<= .cse4 ~token~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0)) .cse10))) [2020-11-07 06:55:21,747 INFO L262 CegarLoopResult]: At program point L395(line 395) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= ~E_M~0 1)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse9)) .cse3 (not (<= .cse9 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-11-07 06:55:21,747 INFO L262 CegarLoopResult]: At program point L394(lines 394 399) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (<= stop_simulation_~tmp~2 0) (<= 0 stop_simulation_~tmp~2))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (let ((.cse4 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse4)) (not (<= .cse4 ~token~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0)) .cse10))) [2020-11-07 06:55:21,748 INFO L269 CegarLoopResult]: At program point L392(line 392) the Hoare annotation is: true [2020-11-07 06:55:21,748 INFO L262 CegarLoopResult]: At program point L392-1(line 392) the Hoare annotation is: (let ((.cse1 (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse6 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0)) .cse10))) [2020-11-07 06:55:21,748 INFO L262 CegarLoopResult]: At program point L392-2(line 392) the Hoare annotation is: (let ((.cse1 (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse6 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0)) .cse10))) [2020-11-07 06:55:21,748 INFO L262 CegarLoopResult]: At program point stop_simulationEXIT(lines 386 404) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= ~E_M~0 1)) (.cse5 (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse7 .cse8 (not (<= ~local~0 ~token~0)) .cse9) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-11-07 06:55:21,749 INFO L262 CegarLoopResult]: At program point L392-3(line 392) the Hoare annotation is: (let ((.cse0 (and (<= stop_simulation_~tmp~2 0) (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0) (<= 0 stop_simulation_~tmp~2))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse6 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0)) .cse10))) [2020-11-07 06:55:21,749 INFO L269 CegarLoopResult]: At program point L388(line 388) the Hoare annotation is: true [2020-11-07 06:55:21,749 INFO L269 CegarLoopResult]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2020-11-07 06:55:21,749 INFO L262 CegarLoopResult]: At program point L217(line 217) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= eval_~tmp~0 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse2 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse5 .cse4 (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse1 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse5)))) [2020-11-07 06:55:21,749 INFO L262 CegarLoopResult]: At program point L213(line 213) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= eval_~tmp~0 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse2 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse5 .cse4 (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse1 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse5)))) [2020-11-07 06:55:21,750 INFO L262 CegarLoopResult]: At program point L205(line 205) the Hoare annotation is: (let ((.cse17 (+ ~local~0 1))) (let ((.cse14 (= ~t1_st~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 0)) (.cse8 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (<= ~token~0 .cse17)) (.cse16 (<= .cse17 ~token~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse10 (not (= |eval_#t~ret8| 0))) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~m_st~0 0)) (.cse7 (not (= eval_~tmp~0 0))) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~local~0 |old(~local~0)|) .cse9 .cse10 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse11 .cse12 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse15 .cse16 .cse2 .cse10 .cse3 .cse5 .cse6 .cse11 .cse7) (and .cse0 .cse2 .cse10 .cse9 .cse3 .cse11 .cse7 (= ~m_pc~0 0) .cse13)))) [2020-11-07 06:55:21,750 INFO L262 CegarLoopResult]: At program point L205-1(line 205) the Hoare annotation is: (let ((.cse17 (+ ~local~0 1))) (let ((.cse14 (= ~t1_st~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 0)) (.cse8 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (<= ~token~0 .cse17)) (.cse16 (<= .cse17 ~token~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse10 (not (= |eval_#t~ret8| 0))) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~m_st~0 0)) (.cse7 (not (= eval_~tmp~0 0))) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~local~0 |old(~local~0)|) .cse9 .cse10 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse11 .cse12 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse15 .cse16 .cse2 .cse10 .cse3 .cse5 .cse6 .cse11 .cse7) (and .cse0 .cse2 .cse10 .cse9 .cse3 .cse11 .cse7 (= ~m_pc~0 0) .cse13)))) [2020-11-07 06:55:21,750 INFO L262 CegarLoopResult]: At program point L205-2(line 205) the Hoare annotation is: (let ((.cse17 (+ ~local~0 1))) (let ((.cse8 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= ~t1_pc~0 0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= ~token~0 .cse17)) (.cse15 (<= .cse17 ~token~0)) (.cse11 (= ~m_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse9 (= ~t1_pc~0 1)) (.cse1 (not (= |eval_#t~ret8| 0))) (.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse3 (not (= eval_~tmp~0 0))) (.cse6 (= |old(~token~0)| ~token~0))) (or (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse0 .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse3 .cse4 .cse5 (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse8 .cse14 .cse15 .cse9 .cse2 .cse11 .cse12) (and .cse8 .cse9 .cse1 .cse16 .cse2 .cse10 .cse11 .cse12 .cse3 .cse13) (not (= |old(~t1_pc~0)| 0)) (and .cse8 .cse1 .cse16 .cse2 .cse10 .cse11 .cse12 .cse3 .cse5 .cse13) (not (<= 2 |old(~E_1~0)|)) (and .cse7 .cse14 .cse15 .cse9 .cse1 .cse2 .cse11 .cse12 .cse4 .cse3) (and .cse7 .cse9 .cse1 .cse0 .cse2 .cse4 .cse3 (= ~m_pc~0 0) .cse6)))) [2020-11-07 06:55:21,751 INFO L262 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse16 (+ ~local~0 1))) (let ((.cse10 (= ~t1_pc~0 0)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~m_st~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse14 (<= ~token~0 .cse16)) (.cse15 (<= .cse16 ~token~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (not (= eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8) (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse12 .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (and .cse0 .cse2 .cse11 .cse3 .cse12 .cse7 (= ~m_pc~0 0) .cse13) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,751 INFO L262 CegarLoopResult]: At program point evalEXIT(lines 196 246) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0)) (let ((.cse6 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse6) (<= .cse6 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,751 INFO L262 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse3 (not (= eval_~tmp~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse7 (= ~m_pc~0 0)) (.cse8 (= |old(~token~0)| ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse3 .cse4 (= ~E_M~0 |old(~E_M~0)|))) (and .cse0 .cse2 .cse5 .cse6 .cse3 .cse4 .cse7 .cse8) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)) (and .cse5 (= ~t1_st~0 0) .cse6 .cse3 (= ~t1_pc~0 0) .cse4 .cse7 .cse8))) [2020-11-07 06:55:21,751 INFO L262 CegarLoopResult]: At program point L214(line 214) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= eval_~tmp~0 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse2 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse5 .cse4 (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse1 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse5)))) [2020-11-07 06:55:21,752 INFO L262 CegarLoopResult]: At program point L214-1(line 214) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= eval_~tmp~0 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse2 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse5 .cse4 (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse1 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse5)))) [2020-11-07 06:55:21,752 INFO L262 CegarLoopResult]: At program point L214-2(line 214) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= eval_~tmp~0 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse2 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse5 .cse4 (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse1 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse5)))) [2020-11-07 06:55:21,752 INFO L262 CegarLoopResult]: At program point L231(line 231) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 (= ~m_st~0 0) .cse8 (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,753 INFO L262 CegarLoopResult]: At program point L227(line 227) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 (= ~m_st~0 0) .cse8 (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,753 INFO L262 CegarLoopResult]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~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)|) (= ~E_M~0 ~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 (= |old(~m_pc~0)| 0))) [2020-11-07 06:55:21,753 INFO L262 CegarLoopResult]: At program point L215(lines 215 222) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= eval_~tmp~0 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse2 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse5 .cse4 (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) .cse6) (not (= |old(~m_pc~0)| 0)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse1 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse5)))) [2020-11-07 06:55:21,753 INFO L262 CegarLoopResult]: At program point L207(lines 207 211) the Hoare annotation is: (let ((.cse16 (+ ~local~0 1))) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~t1_pc~0 0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse14 (<= ~token~0 .cse16)) (.cse15 (<= .cse16 ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (<= ~local~0 ~token~0))) (or (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse2 .cse12 .cse6 (= ~m_pc~0 0) .cse13) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 .cse12 .cse7 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (not (= |old(~m_pc~0)| 0)) (and .cse9 .cse14 .cse15 .cse10 .cse2 .cse4 .cse5 .cse12 .cse6) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse8) (and .cse9 .cse0 .cse14 .cse15 .cse10 .cse2 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|))))) [2020-11-07 06:55:21,754 INFO L262 CegarLoopResult]: At program point L207-1(lines 202 240) the Hoare annotation is: (let ((.cse16 (+ ~local~0 1))) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~t1_pc~0 0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~m_st~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse14 (<= ~token~0 .cse16)) (.cse15 (<= .cse16 ~token~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (not (= eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8) (and .cse0 .cse2 .cse11 .cse3 .cse12 .cse7 (= ~m_pc~0 0) .cse13) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse7 .cse12 .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,754 INFO L262 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse16 (+ ~local~0 1))) (let ((.cse10 (= ~t1_pc~0 0)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~m_st~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse14 (<= ~token~0 .cse16)) (.cse15 (<= .cse16 ~token~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (not (= eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8) (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse12 .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (and .cse0 .cse2 .cse11 .cse3 .cse12 .cse7 (= ~m_pc~0 0) .cse13) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,754 INFO L262 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse4 (not (= ~t1_st~0 0))) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~E_1~0 |old(~E_1~0)|) .cse1 .cse4 (= ~m_st~0 0) .cse6 .cse8 (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,755 INFO L262 CegarLoopResult]: At program point L228(line 228) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 (= ~m_st~0 0) .cse8 (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,755 INFO L262 CegarLoopResult]: At program point L228-1(line 228) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 (= ~m_st~0 0) .cse8 (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,755 INFO L262 CegarLoopResult]: At program point L228-2(line 228) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 (= ~m_st~0 0) .cse8 (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,755 INFO L262 CegarLoopResult]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse16 (+ ~local~0 1))) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~t1_pc~0 0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~m_st~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse14 (<= ~token~0 .cse16)) (.cse15 (<= .cse16 ~token~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (not (= eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8) (and .cse0 .cse2 .cse11 .cse3 .cse12 .cse7 (= ~m_pc~0 0) .cse13) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse3 .cse7 .cse12 .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse13) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7)))) [2020-11-07 06:55:21,756 INFO L262 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0)) (let ((.cse6 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse6) (<= .cse6 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,756 INFO L262 CegarLoopResult]: At program point L229(lines 229 236) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse8 (= ~t1_pc~0 0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (and .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse2 .cse6 (= ~m_st~0 0) .cse8 (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,756 INFO L262 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or (not (= ~m_pc~0 0)) .cse0 .cse3 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,756 INFO L262 CegarLoopResult]: At program point L256-1(lines 250 273) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse11 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= ~local~0 ~token~0))) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse12)) (and .cse3 .cse4 .cse13) (not (<= .cse12 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) (and .cse3 .cse13 .cse5) .cse6 .cse7 .cse8 .cse11 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,757 INFO L262 CegarLoopResult]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (or .cse0 .cse5 .cse6 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4)) (or .cse0 .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,757 INFO L262 CegarLoopResult]: At program point L267(line 267) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (or .cse0 .cse5 .cse6 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4)) (or .cse0 .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,757 INFO L262 CegarLoopResult]: At program point L261-1(lines 250 273) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,757 INFO L262 CegarLoopResult]: At program point L257(line 257) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse2 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or (not (= ~m_pc~0 0)) .cse0 .cse3 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,758 INFO L262 CegarLoopResult]: At program point L251-1(lines 250 273) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= ~local~0 ~token~0))) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse2 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or (not (= ~m_pc~0 0)) .cse0 .cse3 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-11-07 06:55:21,758 INFO L262 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse7 (not (<= 2 ~m_st~0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (and .cse5 .cse6 (= ~M_E~0 2))) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse7 .cse8 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) (and .cse5 (= ~M_E~0 |old(~M_E~0)|) .cse10) .cse1 .cse2 .cse3 .cse11 .cse12 .cse4)) (or .cse0 .cse7 .cse8 (and .cse5 .cse6 .cse10) (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse11 .cse12 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,758 INFO L262 CegarLoopResult]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse7 (not (<= 2 ~m_st~0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (and .cse5 .cse6 (= ~M_E~0 2))) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse7 .cse8 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) (and .cse5 (= ~M_E~0 |old(~M_E~0)|) .cse10) .cse1 .cse2 .cse3 .cse11 .cse12 .cse4)) (or .cse0 .cse7 .cse8 (and .cse5 .cse6 .cse10) (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse11 .cse12 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,759 INFO L262 CegarLoopResult]: At program point L262(line 262) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse4 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or (not (= ~m_pc~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (or .cse0 .cse5 .cse6 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4)) (or .cse0 .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,759 INFO L269 CegarLoopResult]: At program point update_channelsEXIT(lines 150 157) the Hoare annotation is: true [2020-11-07 06:55:21,759 INFO L269 CegarLoopResult]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2020-11-07 06:55:21,759 INFO L262 CegarLoopResult]: At program point L415(line 415) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~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) (= ~m_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 06:55:21,759 INFO L269 CegarLoopResult]: At program point start_simulationEXIT(lines 405 463) the Hoare annotation is: true [2020-11-07 06:55:21,759 INFO L262 CegarLoopResult]: At program point L407(line 407) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 06:55:21,760 INFO L262 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,760 INFO L262 CegarLoopResult]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,760 INFO L262 CegarLoopResult]: At program point L428(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,760 INFO L262 CegarLoopResult]: At program point L428-1(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,760 INFO L262 CegarLoopResult]: At program point L424(line 424) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and (= ~t1_st~0 0) (= ~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) (= ~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)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 06:55:21,761 INFO L262 CegarLoopResult]: At program point L424-1(line 424) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,761 INFO L262 CegarLoopResult]: At program point L420-1(lines 417 457) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and (= ~t1_st~0 0) (= ~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) (= ~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)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 06:55:21,761 INFO L262 CegarLoopResult]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 06:55:21,761 INFO L262 CegarLoopResult]: At program point L416(line 416) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~t1_st~0 0) (= ~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) (= ~m_pc~0 0) (= |old(~token~0)| ~token~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))) [2020-11-07 06:55:21,762 INFO L262 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 06:55:21,762 INFO L262 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (not (= ~E_M~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (<= 2 ~E_1~0))) (or (not (= ~m_i~0 1)) (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)|)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse7 .cse6 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,762 INFO L262 CegarLoopResult]: At program point L408(line 408) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 06:55:21,762 INFO L262 CegarLoopResult]: At program point L437(line 437) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,763 INFO L262 CegarLoopResult]: At program point L437-1(line 437) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,763 INFO L262 CegarLoopResult]: At program point L437-2(line 437) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,763 INFO L262 CegarLoopResult]: At program point L433(line 433) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,763 INFO L269 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-11-07 06:55:21,764 INFO L262 CegarLoopResult]: At program point L421(line 421) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and (= ~t1_st~0 0) (= ~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) (= ~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)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 06:55:21,764 INFO L262 CegarLoopResult]: At program point L450(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (not (= ~E_M~0 1))) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (not (= |start_simulation_#t~ret15| 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 (<= ~local~0 ~token~0) .cse7) (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)|)) (let ((.cse8 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse8) (<= .cse8 ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,764 INFO L262 CegarLoopResult]: At program point L450-1(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (not (= ~E_M~0 1))) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (not (= |start_simulation_#t~ret15| 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 (<= ~local~0 ~token~0) .cse7) (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)|)) (let ((.cse8 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse8) (<= .cse8 ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,764 INFO L262 CegarLoopResult]: At program point L450-2(line 450) the Hoare annotation is: (let ((.cse0 (not (= start_simulation_~tmp___0~1 0))) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (not (= ~E_M~0 1))) (.cse5 (= ~M_E~0 2)) (.cse6 (= ~m_pc~0 1)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (not (= |start_simulation_#t~ret15| 0)))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse8) (let ((.cse9 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse9) (<= .cse9 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (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)))) [2020-11-07 06:55:21,765 INFO L262 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 06:55:21,765 INFO L262 CegarLoopResult]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 06:55:21,765 INFO L262 CegarLoopResult]: At program point L442(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (not (= ~E_M~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (<= 2 ~E_1~0))) (or (not (= ~m_i~0 1)) (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)|)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse7 .cse6 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,765 INFO L262 CegarLoopResult]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (not (= ~E_M~0 1))) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (= ~M_E~0 1))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0) .cse6) (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)|)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,766 INFO L262 CegarLoopResult]: At program point L434(line 434) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,766 INFO L262 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (or (not (= ~m_i~0 1)) (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 (= ~E_1~0 |old(~E_1~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) (= ~m_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0))) [2020-11-07 06:55:21,766 INFO L262 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (not (= ~E_M~0 1))) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (= ~M_E~0 1))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0) .cse6) (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)|)) (let ((.cse7 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,766 INFO L262 CegarLoopResult]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~M_E~0 |old(~M_E~0)|))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,767 INFO L262 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (not (= ~E_M~0 1))) (.cse5 (= ~M_E~0 2)) (.cse6 (= ~m_pc~0 1)) (.cse7 (<= 2 ~E_1~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7)) (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 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (not (= |old(~m_pc~0)| 0)))) [2020-11-07 06:55:21,767 INFO L262 CegarLoopResult]: At program point L452(lines 452 456) the Hoare annotation is: (let ((.cse0 (not (= start_simulation_~tmp___0~1 0))) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~m_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (not (= ~E_M~0 1))) (.cse6 (= ~M_E~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8)) (not (= ~m_i~0 1)) (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 .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 .cse7 .cse8 (<= ~local~0 ~token~0)))) [2020-11-07 06:55:21,767 INFO L262 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1))) (let ((.cse12 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse11 (not (<= 2 ~m_st~0))) (.cse18 (not (<= ~token~0 .cse20))) (.cse19 (not (<= .cse20 ~token~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse16 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse17 (not (= ~t1_st~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse8 (= ~m_st~0 0)) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse1 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse10 .cse14) (or .cse15 .cse0 .cse2 .cse3 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse3 .cse18 .cse19 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14) (or .cse0 .cse11 .cse1 .cse3 .cse2 .cse18 .cse19 .cse5 .cse6 .cse7 .cse9 .cse14) (or .cse15 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (or .cse15 .cse0 .cse3 .cse2 .cse16 .cse5 .cse17 .cse9 (not .cse8) .cse14)))) [2020-11-07 06:55:21,768 INFO L262 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: (let ((.cse19 (+ ~local~0 1))) (let ((.cse3 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_st~0 0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse11 (not (<= ~token~0 .cse19))) (.cse12 (not (<= .cse19 ~token~0))) (.cse17 (= ~E_M~0 1)) (.cse13 (not (= ~m_pc~0 1))) (.cse18 (not (= ~M_E~0 1))) (.cse8 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~t1_st~0))) (.cse7 (= ~m_st~0 0)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8) (or .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse13 .cse14 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse7 .cse6 .cse16) (or .cse1 .cse9 .cse10 .cse17 .cse15 .cse4 .cse13 .cse14 .cse18 .cse16 .cse8) (or .cse1 .cse10 .cse2 .cse15 .cse4 .cse13 .cse14 .cse7 .cse6 .cse16) (or .cse1 .cse9 .cse10 .cse11 .cse12 .cse17 .cse4 .cse13 .cse14 .cse18 .cse8) (or .cse0 .cse1 .cse10 .cse2 .cse15 .cse4 .cse14 .cse7 .cse6 .cse16)))) [2020-11-07 06:55:21,768 INFO L262 CegarLoopResult]: At program point L117(lines 117 122) the Hoare annotation is: (let ((.cse3 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse8 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse7 (= ~m_st~0 0)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) (not (<= 2 ~E_1~0))) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse7 .cse6 .cse9) (or .cse0 .cse1 (not (= ~t1_pc~0 1)) .cse2 .cse8 .cse4 (not (<= 2 ~t1_st~0)) .cse7 .cse6 .cse9))) [2020-11-07 06:55:21,768 INFO L262 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 112 130) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse20))) (.cse17 (not (<= .cse20 ~token~0))) (.cse12 (not (= ~t1_pc~0 0))) (.cse13 (not (= ~t1_st~0 0))) (.cse15 (not (<= 2 ~m_st~0))) (.cse18 (= ~E_M~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse19 (not (= ~M_E~0 1))) (.cse14 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (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))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (= ~m_st~0 0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse12 .cse3 .cse5 .cse13 .cse9 (not .cse8) .cse14) (or .cse0 .cse15 .cse1 .cse2 .cse16 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9 .cse14) (or .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse19 .cse14) (or .cse11 .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse8 .cse9 .cse10) (or .cse0 .cse15 .cse1 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse19 .cse10 .cse14) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10)))) [2020-11-07 06:55:21,768 INFO L269 CegarLoopResult]: At program point L116(lines 116 125) the Hoare annotation is: true [2020-11-07 06:55:21,769 INFO L262 CegarLoopResult]: At program point L116-2(lines 116 125) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (or (not (= ~m_i~0 1)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (not (<= ~token~0 .cse0)) (not (<= .cse0 ~token~0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~E_1~0)))) [2020-11-07 06:55:21,769 INFO L262 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 112 130) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse20))) (.cse17 (not (<= .cse20 ~token~0))) (.cse12 (not (= ~t1_pc~0 0))) (.cse13 (not (= ~t1_st~0 0))) (.cse15 (not (<= 2 ~m_st~0))) (.cse18 (= ~E_M~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse19 (not (= ~M_E~0 1))) (.cse14 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (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))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (= ~m_st~0 0)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse12 .cse3 .cse5 .cse13 .cse9 (not .cse8) .cse14) (or .cse0 .cse15 .cse1 .cse2 .cse16 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9 .cse14) (or .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse19 .cse14) (or .cse11 .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse8 .cse9 .cse10) (or .cse0 .cse15 .cse1 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse19 .cse10 .cse14) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10)))) [2020-11-07 06:55:21,769 INFO L269 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2020-11-07 06:55:21,769 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:55:21,769 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (= ~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 06:55:21,770 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:55:21,770 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:55:21,770 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,770 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,770 INFO L262 CegarLoopResult]: At program point L368(line 368) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-11-07 06:55:21,771 INFO L262 CegarLoopResult]: At program point L362-1(lines 351 374) 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,771 INFO L262 CegarLoopResult]: At program point L358(line 358) 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,771 INFO L262 CegarLoopResult]: At program point L352-1(lines 351 374) 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,771 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,772 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,772 INFO L262 CegarLoopResult]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 .cse7 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-11-07 06:55:21,772 INFO L262 CegarLoopResult]: At program point L357-1(lines 351 374) 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 (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (let ((.cse5 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 .cse5)) (not (<= .cse5 ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= ~local~0 ~token~0))))) [2020-11-07 06:55:21,772 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)) (and (= ~t1_i~0 1) (= ~m_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(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,772 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)) (and (not (= ~t1_i~0 1)) (= ~m_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(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,773 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)) (and (= ~t1_i~0 1) (= ~m_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(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,773 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(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-11-07 06:55:21,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:55:21 BoogieIcfgContainer [2020-11-07 06:55:21,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:55:21,895 INFO L168 Benchmark]: Toolchain (without parser) took 203784.33 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.1 MB in the beginning and 970.5 MB in the end (delta: -843.3 MB). Peak memory consumption was 946.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:21,896 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 129.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:55:21,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.80 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 113.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:21,896 INFO L168 Benchmark]: Boogie Preprocessor took 58.14 ms. Allocated memory is still 151.0 MB. Free memory was 113.9 MB in the beginning and 111.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:21,897 INFO L168 Benchmark]: RCFGBuilder took 979.02 ms. Allocated memory is still 151.0 MB. Free memory was 111.8 MB in the beginning and 107.4 MB in the end (delta: 4.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:21,898 INFO L168 Benchmark]: TraceAbstraction took 202135.28 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 107.4 MB in the beginning and 970.5 MB in the end (delta: -863.0 MB). Peak memory consumption was 925.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:21,904 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.22 ms. Allocated memory is still 151.0 MB. Free memory is still 129.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 590.80 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 113.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.14 ms. Allocated memory is still 151.0 MB. Free memory was 113.9 MB in the beginning and 111.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 979.02 ms. Allocated memory is still 151.0 MB. Free memory was 111.8 MB in the beginning and 107.4 MB in the end (delta: 4.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 202135.28 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 107.4 MB in the beginning and 970.5 MB in the end (delta: -863.0 MB). Peak memory consumption was 925.3 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: (((((((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 1)) || 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) || !(m_i == 1)) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(2 <= E_1))) && ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || (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)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((!(m_i == 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))) && (((((((((((!(m_i == 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))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(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) || !(m_i == 1)) || !(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))) && ((((((((((((__retres1 <= 0 && 0 <= __retres1) || !(m_i == 1)) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(2 <= E_1)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((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)) || (((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && E_M == M_E) && m_st == 0) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == 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)) || !(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))) || !(m_i == 1)) || !(\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) && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_i == 1)) || \old(E_M) == 1) || \old(t1_st) == 0) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1)) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(local <= \old(token))) || !(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))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(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)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((!(m_i == 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 <= \old(m_st))) || !(2 <= E_1)) && ((((((((!(m_pc == 0) || !(m_i == 1)) || !(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))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(M_E == 2)) || ((((t1_pc == 1 && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: ((((((((!(m_i == 1) || !(\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))) || !(\old(E_M) == \old(M_E))) || !(\old(m_pc) == 0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((!(m_i == 1) || !(\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)) || (((((((2 <= t1_st && 2 <= m_st) && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1)) || !(\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: (((((((((((!(m_i == 1) || ((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)) && (((((((((((!(m_i == 1) || ((tmp <= 0 && 1 <= __retres2) && 0 <= tmp)) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(2 <= E_1)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((!(m_i == 1) || !(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)) && ((((((((!(m_i == 1) || !(\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) || !(m_i == 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: ((((((((((!(m_i == 1) || !(\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) || !(m_i == 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)) || !(E_M == M_E)) || ((((((token <= local + 1 && local + 1 <= token) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == 1) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token)))) && (((((((((!(m_i == 1) || !(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: (((((((((((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(2 <= E_1)) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || 1 <= __retres1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) || (0 <= __retres1 && !(E_1 == 1)))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local)) || __retres1 <= 0) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1))) && (((((((((((!(m_pc == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(M_E == 2)) || 1 <= __retres1) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) || (0 <= __retres1 && !(E_1 == 1)))) && (((((((((((!(m_i == 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))) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((((!(m_i == 1) || !(\old(token) <= local)) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(local <= \old(token))) || !(m_pc == 1)) || ((((m_st == \old(m_st) && E_M == M_E) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || (((((t1_pc == 1 && \old(token) + 1 <= token) && (t1_st == 0 || \old(t1_st) == t1_st)) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) || !(m_i == 1)) || \old(E_M) == 1) || \old(t1_st) == 0) || (((((m_st == \old(m_st) && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((E_M == M_E && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token)) || !(2 <= E_1)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((!(m_i == 1) || !(\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)) && ((((((((((((!(M_E == 2) || !(t1_i == 1)) || !(\old(m_pc) == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || (((((2 <= m_st && t1_st == 0) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(E_M == M_E)) || ((((((((2 <= m_st && t1_pc == 1) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(local) + 1 <= \old(token)))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || (((((2 <= m_st && t1_st == 0) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || ((((((((2 <= m_st && t1_pc == 1) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) - 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: (((((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_i == 1)) || \old(E_M) == 1) || \old(t1_st) == 0) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1)) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(local <= \old(token))) || !(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))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(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)) - ProcedureContractResult [Line: 303]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: ((((((((((((((((((!(m_pc == 0) || !(m_i == 1)) || ((((((tmp___0 <= 0 && m_st == \old(m_st)) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(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))) && ((((((((((((!(M_E == 2) || !(token <= local + 1)) || (((((tmp___0 <= 0 && m_st == \old(m_st)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || (((tmp___0 <= 0 && m_st == 0) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(\old(t1_st) == 0)) || !(M_E == 2)) || (((((tmp___0 <= 0 && m_st == \old(m_st)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(t1_pc == 0)) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || (((((tmp___0 <= 0 && tmp <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(E_M == M_E)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || \old(t1_st) == t1_st) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || (((((tmp___0 <= 0 && m_st == \old(m_st)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(2 <= \old(t1_st))) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((tmp___0 <= 0 && m_st == \old(m_st)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(2 <= \old(t1_st))) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((!(M_E == 2) || !(t1_i == 1)) || !(m_pc == 1)) || !(local <= token)) || !(m_i == 1)) || ((((((tmp___0 <= 0 && m_st == \old(m_st)) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || !(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_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || (((((tmp___0 <= 0 && m_st == \old(m_st)) && tmp <= 0) && 0 < tmp + 1) && 0 <= tmp___0) && \old(t1_st) == t1_st)) || !(2 <= \old(t1_st))) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - ProcedureContractResult [Line: 328]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: (((((((((((((!(m_pc == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || !(token <= local)) || \old(m_st) == 0) || (t1_st == 0 && !(m_st == 0))) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || t1_st == 0) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token))) && ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(\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_E == 2) || !(token <= local + 1)) || !(E_M == 1)) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(m_pc == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || (m_st == 0 && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - ProcedureContractResult [Line: 176]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(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))) && (((((((((((!(m_i == 1) || !(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))) && ((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 <= __retres1) || !(m_i == 1)) || !(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_i == 1)) || !(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))) && ((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 <= __retres1) || !(m_i == 1)) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(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)) - ProcedureContractResult [Line: 131]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: (((((((((((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) && (((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(E_M == M_E)) || !(2 <= E_1))) && ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(2 <= E_1))) && (((((((((((!(m_pc == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || ((((0 <= __retres1 && !(E_1 == 1)) && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || (((0 <= __retres1 && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || ((((0 <= __retres1 && !(E_1 == 1)) && __retres1 <= 0) && \result <= 0) && 0 <= \result)) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || \result <= 0) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) - ProcedureContractResult [Line: 275]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((((!(m_i == 1) || !(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) || !(m_i == 1)) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && E_M == 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))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || ((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))) - ProcedureContractResult [Line: 158]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_pc == 0) || !(m_i == 1)) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || (m_st == 0 && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(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: ((((((((((!(m_i == 1) || !(\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)) && ((((((((((((!(M_E == 2) || !(t1_i == 1)) || !(\old(m_pc) == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || (((((2 <= m_st && t1_st == 0) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(E_M == M_E)) || ((((((((2 <= m_st && t1_pc == 1) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(local) + 1 <= \old(token)))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(M_E == 2)) || (((((2 <= m_st && t1_st == 0) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || ((((((((2 <= m_st && t1_pc == 1) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) - ProcedureContractResult [Line: 339]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(token <= local + 1)) || !(t1_pc == 1)) || !(local + 1 <= token)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || M_E == 1) || !(2 <= E_1)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || M_E == 1) || !(local <= token)) || !(2 <= E_1)) - ProcedureContractResult [Line: 196]: Procedure Contract for eval Derived contract for procedure eval: (((((((((!(m_i == 1) || !(\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)) || (((((((2 <= t1_st && 2 <= m_st) && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1)) || !(\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: (((((((((((!(m_i == 1) || !(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)) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 1) || (((tmp <= 0 && 1 <= \result) && 1 <= __retres2) && 0 <= tmp)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(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: ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(t1_pc == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == 2)) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || ((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)))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || ((E_1 == \old(E_1) && E_M == M_E) && E_M == \old(E_M))) || !(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)) - 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: (((((((((((((((!(m_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)) && (((((((((!(m_pc == 0) || !(m_i == 1)) || !(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_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(2 <= E_1))) && ((((((((((!(m_pc == 0) || !(m_i == 1)) || !(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_i == 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) || !(m_i == 1)) || !(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)) || !(m_i == 1)) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || !(token <= local + 1)) || !(local + 1 <= token)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(M_E) == 1)) && (((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(m_i == 1)) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(M_E) == 1)) || !(local <= token)) - 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 && m_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) || \old(m_i) == 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: 91.1s, OverallIterations: 16, TraceHistogramMax: 8, AutomataDifference: 73.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 110.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4326 SDtfs, 27577 SDslu, 2853 SDs, 0 SdLazy, 30222 SolverSat, 9639 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1751 GetRequests, 1086 SyntacticMatches, 2 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10622 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3854occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 8114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 230 LocationsWithAnnotation, 34017 PreInvPairs, 34756 NumberOfFragments, 33034 HoareAnnotationTreeSize, 34017 FomulaSimplifications, 15424778619 FormulaSimplificationTreeSizeReduction, 22.6s HoareSimplificationTime, 230 FomulaSimplificationsInter, 3291516 FormulaSimplificationTreeSizeReductionInter, 87.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 4548 NumberOfCodeBlocks, 4548 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4532 ConstructedInterpolants, 0 QuantifiedInterpolants, 2868328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 3500/3603 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...