java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:40:13,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:40:13,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:40:13,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:40:13,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:40:13,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:40:13,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:40:13,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:40:13,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:40:13,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:40:13,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:40:13,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:40:13,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:40:13,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:40:13,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:40:13,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:40:13,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:40:13,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:40:13,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:40:13,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:40:13,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:40:13,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:40:13,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:40:13,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:40:13,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:40:13,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:40:13,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:40:13,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:40:13,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:40:13,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:40:13,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:40:13,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:40:13,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:40:13,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:40:13,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:40:13,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:40:13,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:40:13,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:40:13,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:40:13,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:40:13,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:40:13,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:40:13,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:40:13,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:40:13,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:40:13,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:40:13,828 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:40:13,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:40:13,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:40:13,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:40:13,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:40:13,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:40:13,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:40:13,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:40:13,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:40:13,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:40:13,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:40:13,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:40:13,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:40:13,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:40:13,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:40:13,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:40:13,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:40:13,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:40:13,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:40:13,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:40:13,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:40:13,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:40:13,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:40:13,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:40:13,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:40:13,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:40:13,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:40:13,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:40:13,899 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:40:13,899 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:40:13,900 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-09-16 16:40:13,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a10d4d16/85c9321a110547c68fd8b4bb328c3b1b/FLAG63263b4d7 [2019-09-16 16:40:14,467 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:40:14,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-09-16 16:40:14,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a10d4d16/85c9321a110547c68fd8b4bb328c3b1b/FLAG63263b4d7 [2019-09-16 16:40:14,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a10d4d16/85c9321a110547c68fd8b4bb328c3b1b [2019-09-16 16:40:14,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:40:14,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:40:14,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:14,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:40:14,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:40:14,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:14" (1/1) ... [2019-09-16 16:40:14,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0f3d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:14, skipping insertion in model container [2019-09-16 16:40:14,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:14" (1/1) ... [2019-09-16 16:40:14,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:40:14,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:40:15,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:15,079 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:40:15,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:15,247 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:40:15,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15 WrapperNode [2019-09-16 16:40:15,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:15,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:40:15,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:40:15,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:40:15,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:40:15,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:40:15,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:40:15,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:40:15,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (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 [2019-09-16 16:40:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:40:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:40:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 16:40:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-16 16:40:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-16 16:40:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-16 16:40:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-16 16:40:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 16:40:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 16:40:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 16:40:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 16:40:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 16:40:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 16:40:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 16:40:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-16 16:40:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 16:40:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 16:40:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 16:40:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 16:40:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 16:40:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:40:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:40:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 16:40:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-16 16:40:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-16 16:40:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-16 16:40:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 16:40:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 16:40:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 16:40:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:40:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:40:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:40:15,894 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:40:15,895 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-16 16:40:15,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:15 BoogieIcfgContainer [2019-09-16 16:40:15,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:40:15,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:40:15,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:40:15,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:40:15,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:40:14" (1/3) ... [2019-09-16 16:40:15,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638808fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:15, skipping insertion in model container [2019-09-16 16:40:15,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (2/3) ... [2019-09-16 16:40:15,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638808fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:15, skipping insertion in model container [2019-09-16 16:40:15,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:15" (3/3) ... [2019-09-16 16:40:15,907 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-09-16 16:40:15,917 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:40:15,926 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:40:15,943 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:40:15,985 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:40:15,986 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:40:15,986 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:40:15,986 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:40:15,986 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:40:15,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:40:15,987 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:40:15,987 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:40:15,987 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:40:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-16 16:40:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:16,025 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:16,026 INFO L407 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] [2019-09-16 16:40:16,029 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2019-09-16 16:40:16,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:16,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:16,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:16,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:16,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:16,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:16,398 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-16 16:40:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:17,048 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2019-09-16 16:40:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:17,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:17,064 INFO L225 Difference]: With dead ends: 298 [2019-09-16 16:40:17,064 INFO L226 Difference]: Without dead ends: 161 [2019-09-16 16:40:17,070 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-16 16:40:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-09-16 16:40:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-16 16:40:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2019-09-16 16:40:17,141 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2019-09-16 16:40:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:17,142 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2019-09-16 16:40:17,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2019-09-16 16:40:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:17,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:17,147 INFO L407 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] [2019-09-16 16:40:17,147 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 246293706, now seen corresponding path program 1 times [2019-09-16 16:40:17,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:17,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:17,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:17,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:17,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:17,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:17,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:17,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:17,313 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2019-09-16 16:40:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:17,777 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2019-09-16 16:40:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:17,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:17,783 INFO L225 Difference]: With dead ends: 277 [2019-09-16 16:40:17,783 INFO L226 Difference]: Without dead ends: 161 [2019-09-16 16:40:17,788 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-16 16:40:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-09-16 16:40:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-16 16:40:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2019-09-16 16:40:17,816 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2019-09-16 16:40:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:17,816 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2019-09-16 16:40:17,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2019-09-16 16:40:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:17,819 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:17,819 INFO L407 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] [2019-09-16 16:40:17,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1633079116, now seen corresponding path program 1 times [2019-09-16 16:40:17,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:17,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:17,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:17,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:17,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:17,926 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2019-09-16 16:40:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:18,291 INFO L93 Difference]: Finished difference Result 285 states and 387 transitions. [2019-09-16 16:40:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:18,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:18,295 INFO L225 Difference]: With dead ends: 285 [2019-09-16 16:40:18,295 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 16:40:18,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 16:40:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2019-09-16 16:40:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-16 16:40:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-09-16 16:40:18,326 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2019-09-16 16:40:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:18,327 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-09-16 16:40:18,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-09-16 16:40:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:18,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:18,332 INFO L407 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] [2019-09-16 16:40:18,333 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:18,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2076979790, now seen corresponding path program 1 times [2019-09-16 16:40:18,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:18,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:18,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:18,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:18,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:18,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:18,436 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 6 states. [2019-09-16 16:40:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:18,477 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2019-09-16 16:40:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:18,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-16 16:40:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:18,480 INFO L225 Difference]: With dead ends: 260 [2019-09-16 16:40:18,480 INFO L226 Difference]: Without dead ends: 145 [2019-09-16 16:40:18,481 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-16 16:40:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2019-09-16 16:40:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-16 16:40:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2019-09-16 16:40:18,520 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 77 [2019-09-16 16:40:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:18,523 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2019-09-16 16:40:18,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2019-09-16 16:40:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:18,532 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:18,532 INFO L407 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] [2019-09-16 16:40:18,532 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash 705172492, now seen corresponding path program 1 times [2019-09-16 16:40:18,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:18,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:18,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:18,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:18,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:18,645 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand 4 states. [2019-09-16 16:40:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:18,830 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2019-09-16 16:40:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:18,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 16:40:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:18,833 INFO L225 Difference]: With dead ends: 373 [2019-09-16 16:40:18,834 INFO L226 Difference]: Without dead ends: 253 [2019-09-16 16:40:18,836 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-16 16:40:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2019-09-16 16:40:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-16 16:40:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2019-09-16 16:40:18,864 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 77 [2019-09-16 16:40:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:18,865 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2019-09-16 16:40:18,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2019-09-16 16:40:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:18,867 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:18,867 INFO L407 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] [2019-09-16 16:40:18,867 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1830432461, now seen corresponding path program 1 times [2019-09-16 16:40:18,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:18,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:18,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:18,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:18,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:18,925 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 6 states. [2019-09-16 16:40:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:18,987 INFO L93 Difference]: Finished difference Result 483 states and 633 transitions. [2019-09-16 16:40:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:18,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-16 16:40:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:18,990 INFO L225 Difference]: With dead ends: 483 [2019-09-16 16:40:18,990 INFO L226 Difference]: Without dead ends: 255 [2019-09-16 16:40:18,992 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-16 16:40:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-09-16 16:40:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-16 16:40:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 320 transitions. [2019-09-16 16:40:19,027 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 320 transitions. Word has length 77 [2019-09-16 16:40:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:19,030 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 320 transitions. [2019-09-16 16:40:19,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2019-09-16 16:40:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:19,032 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:19,032 INFO L407 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] [2019-09-16 16:40:19,032 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1762934961, now seen corresponding path program 1 times [2019-09-16 16:40:19,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:19,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:19,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:19,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:19,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:19,108 INFO L87 Difference]: Start difference. First operand 253 states and 320 transitions. Second operand 5 states. [2019-09-16 16:40:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:19,444 INFO L93 Difference]: Finished difference Result 587 states and 751 transitions. [2019-09-16 16:40:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:19,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:19,447 INFO L225 Difference]: With dead ends: 587 [2019-09-16 16:40:19,448 INFO L226 Difference]: Without dead ends: 355 [2019-09-16 16:40:19,449 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-16 16:40:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 313. [2019-09-16 16:40:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-16 16:40:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 384 transitions. [2019-09-16 16:40:19,477 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 384 transitions. Word has length 77 [2019-09-16 16:40:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:19,477 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-09-16 16:40:19,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 384 transitions. [2019-09-16 16:40:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:19,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:19,479 INFO L407 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] [2019-09-16 16:40:19,479 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 160293073, now seen corresponding path program 1 times [2019-09-16 16:40:19,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:19,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:19,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:19,534 INFO L87 Difference]: Start difference. First operand 313 states and 384 transitions. Second operand 5 states. [2019-09-16 16:40:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:19,810 INFO L93 Difference]: Finished difference Result 605 states and 746 transitions. [2019-09-16 16:40:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:19,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:19,813 INFO L225 Difference]: With dead ends: 605 [2019-09-16 16:40:19,813 INFO L226 Difference]: Without dead ends: 313 [2019-09-16 16:40:19,815 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-16 16:40:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-09-16 16:40:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-16 16:40:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 380 transitions. [2019-09-16 16:40:19,840 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 380 transitions. Word has length 77 [2019-09-16 16:40:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:19,841 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 380 transitions. [2019-09-16 16:40:19,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 380 transitions. [2019-09-16 16:40:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:19,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:19,842 INFO L407 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] [2019-09-16 16:40:19,843 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 222332687, now seen corresponding path program 1 times [2019-09-16 16:40:19,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:19,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:19,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:19,897 INFO L87 Difference]: Start difference. First operand 313 states and 380 transitions. Second operand 5 states. [2019-09-16 16:40:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:20,293 INFO L93 Difference]: Finished difference Result 757 states and 983 transitions. [2019-09-16 16:40:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:40:20,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:20,298 INFO L225 Difference]: With dead ends: 757 [2019-09-16 16:40:20,298 INFO L226 Difference]: Without dead ends: 464 [2019-09-16 16:40:20,300 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:40:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-16 16:40:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2019-09-16 16:40:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-16 16:40:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 463 transitions. [2019-09-16 16:40:20,335 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 463 transitions. Word has length 77 [2019-09-16 16:40:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:20,336 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 463 transitions. [2019-09-16 16:40:20,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 463 transitions. [2019-09-16 16:40:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:20,337 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:20,338 INFO L407 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] [2019-09-16 16:40:20,338 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash -835288726, now seen corresponding path program 1 times [2019-09-16 16:40:20,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:20,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:20,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:20,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:20,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:20,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:20,386 INFO L87 Difference]: Start difference. First operand 384 states and 463 transitions. Second operand 5 states. [2019-09-16 16:40:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:20,819 INFO L93 Difference]: Finished difference Result 727 states and 886 transitions. [2019-09-16 16:40:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:20,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:20,823 INFO L225 Difference]: With dead ends: 727 [2019-09-16 16:40:20,823 INFO L226 Difference]: Without dead ends: 363 [2019-09-16 16:40:20,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-16 16:40:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 333. [2019-09-16 16:40:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-16 16:40:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 392 transitions. [2019-09-16 16:40:20,860 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 392 transitions. Word has length 78 [2019-09-16 16:40:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:20,860 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 392 transitions. [2019-09-16 16:40:20,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 392 transitions. [2019-09-16 16:40:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:20,864 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:20,864 INFO L407 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] [2019-09-16 16:40:20,864 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:20,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash 362881297, now seen corresponding path program 1 times [2019-09-16 16:40:20,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:20,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:20,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:20,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:20,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:20,962 INFO L87 Difference]: Start difference. First operand 333 states and 392 transitions. Second operand 5 states. [2019-09-16 16:40:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:21,345 INFO L93 Difference]: Finished difference Result 737 states and 919 transitions. [2019-09-16 16:40:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:21,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-16 16:40:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:21,349 INFO L225 Difference]: With dead ends: 737 [2019-09-16 16:40:21,349 INFO L226 Difference]: Without dead ends: 425 [2019-09-16 16:40:21,352 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-16 16:40:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 364. [2019-09-16 16:40:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-16 16:40:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 417 transitions. [2019-09-16 16:40:21,394 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 417 transitions. Word has length 77 [2019-09-16 16:40:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:21,396 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 417 transitions. [2019-09-16 16:40:21,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 417 transitions. [2019-09-16 16:40:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 16:40:21,398 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:21,398 INFO L407 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] [2019-09-16 16:40:21,398 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2019-09-16 16:40:21,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:21,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:21,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:21,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:40:21,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:40:21,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:40:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:21,455 INFO L87 Difference]: Start difference. First operand 364 states and 417 transitions. Second operand 3 states. [2019-09-16 16:40:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:21,523 INFO L93 Difference]: Finished difference Result 1024 states and 1227 transitions. [2019-09-16 16:40:21,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:40:21,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-16 16:40:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:21,529 INFO L225 Difference]: With dead ends: 1024 [2019-09-16 16:40:21,529 INFO L226 Difference]: Without dead ends: 680 [2019-09-16 16:40:21,531 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-16 16:40:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2019-09-16 16:40:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-16 16:40:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 787 transitions. [2019-09-16 16:40:21,591 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 787 transitions. Word has length 77 [2019-09-16 16:40:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:21,591 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 787 transitions. [2019-09-16 16:40:21,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:40:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 787 transitions. [2019-09-16 16:40:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 16:40:21,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:21,594 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:21,594 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2019-09-16 16:40:21,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 16:40:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:21,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:21,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:21,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:21,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:21,706 INFO L87 Difference]: Start difference. First operand 676 states and 787 transitions. Second operand 4 states. [2019-09-16 16:40:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,049 INFO L93 Difference]: Finished difference Result 1722 states and 2036 transitions. [2019-09-16 16:40:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:22,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 16:40:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,059 INFO L225 Difference]: With dead ends: 1722 [2019-09-16 16:40:22,059 INFO L226 Difference]: Without dead ends: 805 [2019-09-16 16:40:22,066 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-09-16 16:40:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-09-16 16:40:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-16 16:40:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 897 transitions. [2019-09-16 16:40:22,159 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 897 transitions. Word has length 121 [2019-09-16 16:40:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:22,160 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 897 transitions. [2019-09-16 16:40:22,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 897 transitions. [2019-09-16 16:40:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-16 16:40:22,167 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:22,168 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:22,168 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2019-09-16 16:40:22,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 16:40:22,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:22,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:22,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:22,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-16 16:40:22,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream Closed [2019-09-16 16:40:22,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:22,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-16 16:40:22,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:22,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:22,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:22,523 INFO L87 Difference]: Start difference. First operand 797 states and 897 transitions. Second operand 4 states. [2019-09-16 16:40:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,821 INFO L93 Difference]: Finished difference Result 1906 states and 2163 transitions. [2019-09-16 16:40:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:22,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-16 16:40:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,827 INFO L225 Difference]: With dead ends: 1906 [2019-09-16 16:40:22,827 INFO L226 Difference]: Without dead ends: 563 [2019-09-16 16:40:22,832 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-16 16:40:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-09-16 16:40:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-16 16:40:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 617 transitions. [2019-09-16 16:40:22,878 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 617 transitions. Word has length 176 [2019-09-16 16:40:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:22,880 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 617 transitions. [2019-09-16 16:40:22,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 617 transitions. [2019-09-16 16:40:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-16 16:40:22,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:22,885 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:22,885 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2019-09-16 16:40:22,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:22,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 16:40:23,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:23,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:23,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:23,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:23,064 INFO L87 Difference]: Start difference. First operand 563 states and 617 transitions. Second operand 6 states. [2019-09-16 16:40:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:23,825 INFO L93 Difference]: Finished difference Result 705 states and 782 transitions. [2019-09-16 16:40:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:40:23,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-16 16:40:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:23,826 INFO L225 Difference]: With dead ends: 705 [2019-09-16 16:40:23,826 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:40:23,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:40:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:40:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:40:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:40:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:40:23,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-09-16 16:40:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:23,832 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:40:23,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:40:23,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:40:23,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:40:26,957 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-16 16:40:29,019 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 125 DAG size of output: 57 [2019-09-16 16:40:29,575 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-16 16:40:30,323 WARN L191 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:31,092 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:31,297 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-16 16:40:32,079 WARN L191 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:32,843 WARN L191 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:32,967 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-16 16:40:33,755 WARN L191 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:34,522 WARN L191 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-16 16:40:34,709 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-16 16:40:35,473 WARN L191 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:37,536 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2019-09-16 16:40:38,088 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-16 16:40:39,566 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-09-16 16:40:40,657 WARN L191 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-16 16:40:41,671 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-16 16:40:42,405 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:43,794 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-16 16:40:44,094 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-16 16:40:45,444 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2019-09-16 16:40:45,688 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-16 16:40:47,170 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-16 16:40:47,596 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-16 16:40:48,389 WARN L191 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:49,848 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-16 16:40:49,970 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-16 16:40:50,093 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-16 16:40:50,406 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-16 16:40:51,470 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-16 16:40:51,970 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-16 16:40:52,462 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-16 16:40:52,833 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-16 16:40:54,511 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-16 16:40:54,925 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-16 16:40:55,863 WARN L191 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-09-16 16:40:56,271 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-16 16:40:57,053 WARN L191 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-16 16:40:58,742 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-09-16 16:40:59,725 WARN L191 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-09-16 16:41:00,207 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-16 16:41:00,676 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-16 16:41:00,804 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-16 16:41:01,105 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-16 16:41:01,244 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-16 16:41:01,642 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-16 16:41:01,728 INFO L443 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2019-09-16 16:41:01,729 INFO L439 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse15 (<= 2 ~t1_st~0)) (.cse11 (= 1 ~E_M~0)) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= 1 ~E_1~0)) (.cse5 (= 0 ~E_1~0)) (.cse6 (not .cse12)) (.cse7 (= 0 ~E_M~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (= 0 ~M_E~0)) (.cse4 (<= 2 ~m_st~0)) (.cse13 (= 1 ~m_pc~0)) (.cse10 (= 1 ~M_E~0))) (and (let ((.cse3 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~token~0)) .cse4 .cse5 .cse6 .cse7 (not (<= ~token~0 .cse3)) .cse8 .cse9 .cse10)) (or .cse11 .cse0 .cse1 .cse5 (= 0 ~t1_st~0) .cse7 .cse12 .cse9 .cse13 .cse10 (not (= |old(~t1_st~0)| 0))) (or .cse11 .cse14 .cse0 .cse1 .cse15 .cse5 .cse7 .cse12 .cse9 .cse13 .cse10) (or .cse15 .cse11 .cse14 .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= ~local~0 ~token~0)) .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse4 .cse13 .cse10)))) [2019-09-16 16:41:01,729 INFO L443 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2019-09-16 16:41:01,730 INFO L439 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse15 (<= 2 ~m_st~0)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~E_M~0 1)))) (let ((.cse14 (and .cse15 .cse11 .cse12)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse17 (= |old(~t1_pc~0)| 1)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= ~m_st~0 0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse18 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse12) .cse13 .cse14) (or .cse6 .cse7 .cse0 .cse8 .cse9 (and .cse15 .cse16) .cse13 .cse17 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse0 .cse8 .cse14 .cse9 .cse13 .cse3 .cse4 .cse18 .cse5) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 (and .cse10 (<= ~token~0 ~local~0) .cse16 (<= ~local~0 ~token~0)) .cse13 .cse18)))) [2019-09-16 16:41:01,730 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-09-16 16:41:01,730 INFO L439 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse3 (= |old(~t1_pc~0)| 1)) (.cse18 (= 1 ~t1_pc~0))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse11 (not .cse18)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse16 (not .cse3)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse19 (<= 2 ~m_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= 0 ~M_E~0)) (.cse15 (= 1 ~m_pc~0)) (.cse5 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 (and .cse11 (= ~m_st~0 0) .cse12 .cse13 .cse14) .cse15) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse18 .cse19 .cse12 .cse13 .cse14) .cse9 .cse10) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse17 .cse4 .cse5 (and .cse11 .cse19 .cse13)) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse16 .cse10 .cse17 (and .cse18 .cse19 .cse13) .cse4 .cse15 .cse5)))) [2019-09-16 16:41:01,730 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-09-16 16:41:01,731 INFO L439 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse11 (= 1 ~m_pc~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_1~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~m_st~0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 .cse11) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse12 (and .cse13 .cse14 .cse15) .cse4 .cse11 .cse5) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse12 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse13 .cse14 (<= ~token~0 ~local~0) .cse15 (<= ~local~0 ~token~0)) .cse9 .cse10))) [2019-09-16 16:41:01,731 INFO L443 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2019-09-16 16:41:01,731 INFO L439 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse11 (= 1 ~t1_pc~0)) (.cse7 (= ~T1_E~0 1)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (not (= ~E_M~0 0))) (.cse0 (= ~T1_E~0 0)) (.cse20 (not (= ~E_M~0 1)))) (let ((.cse15 (= 1 ~m_pc~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse17 (and .cse11 (not .cse7) .cse18 .cse19 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse0) (not (= ~E_1~0 0)) .cse20)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse12 (= ~m_st~0 0)) (.cse13 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 (<= ~token~0 ~local~0) .cse14 (<= ~local~0 ~token~0)) .cse15) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse16 .cse17 .cse4 .cse15 .cse5) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse16 (and .cse11 .cse18 .cse13 .cse14) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 (and .cse11 .cse18 .cse19 .cse13 .cse20) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse19 .cse13 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse20))))) [2019-09-16 16:41:01,731 INFO L439 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse11 (= 1 ~m_pc~0)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (<= 2 ~m_st~0)) (.cse14 (not (= ~E_M~0 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 .cse11) (or .cse6 .cse7 .cse0 .cse8 .cse9 (and .cse12 .cse13 .cse14) .cse10 .cse15 .cse4 .cse11 .cse5) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse12 .cse13 .cse14 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0))) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse15 .cse4 .cse5))) [2019-09-16 16:41:01,731 INFO L443 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2019-09-16 16:41:01,731 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-09-16 16:41:01,731 INFO L443 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2019-09-16 16:41:01,732 INFO L443 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2019-09-16 16:41:01,732 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-09-16 16:41:01,732 INFO L439 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse4 (= 0 ~t1_st~0)) (.cse24 (= ~m_st~0 0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse20 (not (<= .cse25 ~token~0))) (.cse12 (not .cse6)) (.cse22 (not (<= ~token~0 .cse25))) (.cse9 (= 1 ~M_E~0)) (.cse21 (and .cse24 .cse15)) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (and .cse14 .cse4)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse2 (= ~T1_E~0 0)) (.cse17 (not (<= ~token~0 ~local~0))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 ~E_M~0)) (.cse1 (= ~T1_E~0 1)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse11 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse8 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse3 .cse12 .cse5 .cse13 .cse7 .cse14 .cse8 .cse9) (or .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse3 .cse12 .cse18 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse14 .cse11 .cse3 .cse5 .cse13 .cse7 .cse8) (or .cse2 .cse12 .cse7 .cse0 .cse16 .cse19 .cse1 .cse11 .cse20 .cse21 .cse3 .cse5 .cse22) (or .cse0 .cse16 .cse19 .cse1 .cse2 .cse11 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse11 .cse20 .cse14 .cse3 .cse12 .cse5 .cse22 .cse13 .cse7 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse11 (and .cse14 .cse15) .cse3 .cse5 .cse13 .cse7) (or .cse2 .cse17 .cse18 .cse21 .cse7 .cse0 .cse16 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse23 .cse11 .cse3 .cse5 .cse6 .cse13 .cse7 .cse10) (or .cse2 .cse23 .cse17 .cse18 .cse13 .cse7 .cse10 .cse0 .cse1 .cse11 .cse3 .cse5) (or .cse2 .cse17 .cse18 .cse6 .cse7 .cse10 (and .cse24 .cse4) .cse0 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8)))) [2019-09-16 16:41:01,732 INFO L439 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse26 (= ~m_st~0 0)) (.cse12 (<= 2 ~t1_st~0)) (.cse27 (+ ~local~0 1)) (.cse7 (= ~t1_pc~0 1)) (.cse1 (= ~T1_E~0 1)) (.cse11 (not (= ~m_pc~0 1))) (.cse2 (= ~T1_E~0 0)) (.cse21 (<= 2 ~m_st~0)) (.cse18 (= 0 ~t1_st~0))) (let ((.cse3 (and .cse21 .cse18)) (.cse20 (and (not .cse1) .cse21 .cse11 (not .cse2) (not (= ~E_M~0 1)))) (.cse15 (not .cse7)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse17 (= 1 ~M_E~0)) (.cse23 (not (<= .cse27 ~token~0))) (.cse25 (not (<= ~token~0 .cse27))) (.cse24 (and .cse26 .cse12)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse9 (= 0 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 ~E_M~0)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse4 (= 1 ~E_1~0)) (.cse5 (= 0 ~E_1~0)) (.cse6 (= 0 ~E_M~0)) (.cse19 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse13 .cse1 .cse2 .cse14 .cse5 .cse15 .cse16 .cse6 .cse9 .cse17) (or .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse19 .cse17 .cse10) (or .cse0 .cse13 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse8 (and .cse21 .cse12) .cse9) (or .cse2 .cse20 .cse3 .cse14 .cse16 .cse8 .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse21 .cse5 .cse15 .cse6 .cse8 .cse9 .cse19 .cse17) (or .cse2 .cse15 .cse9 .cse0 .cse13 .cse22 .cse1 .cse4 .cse23 .cse24 .cse5 .cse6 .cse25) (or .cse0 .cse13 .cse22 .cse1 .cse2 .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19) (or .cse0 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7 .cse9 .cse19 .cse17) (or .cse2 .cse26 .cse15 .cse8 .cse9 .cse21 .cse17 .cse1 .cse4 .cse23 .cse5 .cse6 .cse25) (or .cse2 .cse14 .cse16 .cse24 .cse9 .cse0 .cse13 .cse1 .cse22 .cse4 .cse5 .cse6 .cse19) (or .cse2 .cse14 .cse16 .cse7 .cse9 .cse10 (and .cse26 .cse18) .cse0 .cse1 .cse22 .cse4 .cse5 .cse6 .cse19)))) [2019-09-16 16:41:01,732 INFO L443 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2019-09-16 16:41:01,733 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse4 (= 0 ~t1_st~0)) (.cse24 (= ~m_st~0 0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse20 (not (<= .cse25 ~token~0))) (.cse12 (not .cse6)) (.cse22 (not (<= ~token~0 .cse25))) (.cse9 (= 1 ~M_E~0)) (.cse21 (and .cse24 .cse15)) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (and .cse14 .cse4)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse2 (= ~T1_E~0 0)) (.cse17 (not (<= ~token~0 ~local~0))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 ~E_M~0)) (.cse1 (= ~T1_E~0 1)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse11 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse8 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse3 .cse12 .cse5 .cse13 .cse7 .cse14 .cse8 .cse9) (or .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse3 .cse12 .cse18 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse14 .cse11 .cse3 .cse5 .cse13 .cse7 .cse8) (or .cse2 .cse12 .cse7 .cse0 .cse16 .cse19 .cse1 .cse11 .cse20 .cse21 .cse3 .cse5 .cse22) (or .cse0 .cse16 .cse19 .cse1 .cse2 .cse11 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse11 .cse20 .cse14 .cse3 .cse12 .cse5 .cse22 .cse13 .cse7 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse11 (and .cse14 .cse15) .cse3 .cse5 .cse13 .cse7) (or .cse2 .cse17 .cse18 .cse21 .cse7 .cse0 .cse16 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse23 .cse11 .cse3 .cse5 .cse6 .cse13 .cse7 .cse10) (or .cse2 .cse23 .cse17 .cse18 .cse13 .cse7 .cse10 .cse0 .cse1 .cse11 .cse3 .cse5) (or .cse2 .cse17 .cse18 .cse6 .cse7 .cse10 (and .cse24 .cse4) .cse0 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8)))) [2019-09-16 16:41:01,733 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2019-09-16 16:41:01,733 INFO L446 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: true [2019-09-16 16:41:01,733 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2019-09-16 16:41:01,733 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-09-16 16:41:01,733 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2019-09-16 16:41:01,734 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-09-16 16:41:01,734 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2019-09-16 16:41:01,734 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2019-09-16 16:41:01,734 INFO L446 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2019-09-16 16:41:01,734 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2019-09-16 16:41:01,734 INFO L439 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse4 (= 0 ~E_1~0)) (.cse10 (not .cse15)) (.cse8 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse21 (+ ~local~0 1))) (let ((.cse13 (not (<= .cse21 ~token~0))) (.cse14 (not (<= ~token~0 .cse21))) (.cse18 (or .cse1 .cse2 .cse4 .cse10 .cse8 .cse16)) (.cse7 (not (<= 2 ~m_st~0))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse19 (not (<= ~token~0 ~local~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse5 (= is_transmit1_triggered_~__retres1~1 0)) (.cse17 (not (= ~t1_st~0 0))) (.cse0 (= 1 ~E_M~0)) (.cse12 (not (= 0 ~m_st~0))) (.cse3 (= 1 ~E_1~0)) (.cse6 (= 0 ~E_M~0)) (.cse9 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse5 .cse8 .cse0 .cse11 .cse12 .cse1 .cse3 .cse13 .cse4 .cse6 .cse14) (or .cse0 .cse5 .cse11 .cse1 .cse2 .cse4 .cse6 .cse15 .cse8 .cse9 .cse16) (or .cse0 .cse11 .cse12 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse5 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse15 .cse7 .cse8 .cse17) (or .cse18 .cse12 .cse3 .cse13 .cse5 .cse6 .cse14) (or .cse2 .cse19 .cse10 .cse20 .cse5 .cse8 .cse16 .cse0 .cse3 .cse11 .cse1 .cse4 .cse6) (or .cse2 .cse19 .cse20 .cse7 .cse8 .cse17 .cse0 .cse1 .cse3 .cse4 .cse6 .cse5) (or .cse18 .cse3 .cse6 .cse5 .cse7) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse15 .cse5 .cse8 .cse9 .cse16 .cse17) (or .cse2 .cse5 .cse19 .cse20 .cse8 .cse0 .cse11 .cse1 .cse12 .cse3 .cse4 .cse6 .cse9) (or .cse2 .cse19 .cse20 .cse15 .cse5 .cse8 .cse17 .cse0 .cse1 .cse12 .cse3 .cse4 .cse6 .cse9))))) [2019-09-16 16:41:01,735 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-09-16 16:41:01,735 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-09-16 16:41:01,735 INFO L443 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-09-16 16:41:01,735 INFO L443 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-09-16 16:41:01,735 INFO L443 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-09-16 16:41:01,735 INFO L443 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-09-16 16:41:01,736 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse12 (= 1 ~m_pc~0)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse4 (= 1 |old(~E_M~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse1 (= ~t1_pc~0 1)) (.cse17 (not (<= 2 ~m_st~0))) (.cse10 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (= 0 |old(~M_E~0)|)) (.cse3 (= 1 |old(~M_E~0)|)) (.cse16 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (or .cse10 .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 (not (<= .cse13 ~token~0)) .cse8 .cse9 (not (<= ~token~0 .cse13)) .cse11)) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse3 .cse16 .cse4 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse17 .cse10 .cse2 .cse12 .cse3) (or .cse0 .cse14 .cse15 .cse17 .cse2 .cse3 .cse16 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse5 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse17 .cse2 .cse3) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse1 .cse17 .cse10 .cse2 .cse3 .cse16))) [2019-09-16 16:41:01,736 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2019-09-16 16:41:01,736 INFO L443 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2019-09-16 16:41:01,736 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-09-16 16:41:01,736 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2019-09-16 16:41:01,736 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (= ~T1_E~0 0) (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) (= ~t1_pc~0 1) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_1~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (and (= ~m_st~0 0) (= 0 ~t1_st~0)) (= 1 ~m_pc~0)) [2019-09-16 16:41:01,736 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2019-09-16 16:41:01,737 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,737 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2019-09-16 16:41:01,737 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2019-09-16 16:41:01,737 INFO L443 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2019-09-16 16:41:01,737 INFO L439 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,737 INFO L439 ceAbstractionStarter]: At program point L467-1(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,738 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2019-09-16 16:41:01,738 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-09-16 16:41:01,738 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2019-09-16 16:41:01,738 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2019-09-16 16:41:01,738 INFO L443 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2019-09-16 16:41:01,738 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-16 16:41:01,739 INFO L439 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse14 (+ |old(~local~0)| 1))) (let ((.cse9 (= 1 |old(~m_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse10 (= ~t1_pc~0 1)) (.cse1 (= 0 ~M_E~0)) (.cse2 (= 1 ~M_E~0)) (.cse3 (= 1 ~E_M~0)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= ~T1_E~0 1)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse11 (not (<= .cse14 |old(~token~0)|))) (.cse7 (= 0 |old(~E_1~0)|)) (.cse8 (= 0 ~E_M~0)) (.cse12 (not (<= |old(~token~0)| .cse14)))) (and (or .cse0 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse3 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2 (not (= |old(~t1_st~0)| 0))) (or .cse0 (not .cse10) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 (let ((.cse13 (+ ~local~0 1))) (and (<= ~token~0 .cse13) (<= 2 ~t1_st~0) (= |old(~token~0)| ~token~0) (<= .cse13 ~token~0) (= ~E_1~0 |old(~E_1~0)|))) .cse7 .cse8 .cse12)))) [2019-09-16 16:41:01,739 INFO L439 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse18 (= 0 ~t1_st~0)) (.cse13 (<= 2 ~m_st~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (not (= ~E_1~0 1))) (.cse19 (not .cse0)) (.cse16 (not (= ~E_1~0 0)))) (let ((.cse1 (and .cse13 .cse14 .cse15 .cse19 .cse16)) (.cse2 (and .cse13 .cse18 .cse15 .cse19 (<= ~token~0 ~local~0) .cse16 (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= 1 ~E_M~0)) (.cse8 (= ~T1_E~0 1)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 ~E_M~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= 0 ~M_E~0)) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse5 (= 1 ~M_E~0))) (and (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)) .cse11 .cse12 (not (<= |old(~token~0)| .cse10)))) (or .cse6 .cse7 .cse8 .cse0 .cse9 (and .cse13 .cse14 .cse15 .cse16) .cse11 .cse12 .cse3 .cse4 .cse17 .cse5) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17) (or .cse6 .cse8 .cse0 .cse9 (and .cse13 .cse18 .cse15 .cse16) .cse11 .cse12 .cse3 .cse4 .cse17 .cse5 (not (= |old(~t1_st~0)| 0))))))) [2019-09-16 16:41:01,739 INFO L439 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse9 (= 1 |old(~m_pc~0)|)) (.cse3 (= 1 ~E_M~0)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse7 (= 0 |old(~E_1~0)|)) (.cse10 (= ~t1_pc~0 1)) (.cse8 (= 0 ~E_M~0)) (.cse1 (= 0 ~M_E~0)) (.cse2 (= 1 ~M_E~0))) (and (or .cse0 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2) (or .cse3 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2 (not (= |old(~t1_st~0)| 0))) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse3 .cse4 .cse5 .cse0 .cse6 (not (<= .cse11 |old(~token~0)|)) .cse7 (not .cse10) .cse8 (not (<= |old(~token~0)| .cse11)) .cse1 .cse2)))) [2019-09-16 16:41:01,740 INFO L439 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse19 (+ |old(~local~0)| 1)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse12 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= ~m_pc~0 1))) (.cse1 (= ~T1_E~0 0)) (.cse13 (not .cse17)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse7 (not (<= .cse19 |old(~token~0)|))) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 ~E_M~0)) (.cse10 (not (<= |old(~token~0)| .cse19)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) .cse2 .cse3 (and .cse14 .cse0 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse4 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 (and (= 0 ~t1_st~0) .cse0 .cse16) .cse2 .cse12 .cse3 (not (= |old(~t1_st~0)| 0))) (or .cse4 .cse5 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 .cse2 .cse12 .cse3 (and .cse14 .cse0 .cse16)) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse18 (+ ~local~0 1))) (and (<= ~token~0 .cse18) .cse14 .cse15 (<= .cse18 ~token~0) .cse16)) .cse9 .cse11 .cse10)))) [2019-09-16 16:41:01,740 INFO L439 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse20 (+ |old(~local~0)| 1)) (.cse7 (= ~t1_pc~0 1)) (.cse2 (= ~T1_E~0 1)) (.cse8 (<= 2 ~t1_st~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse3 (= ~T1_E~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse10 (not (= ~E_1~0 0))) (.cse13 (= 1 ~M_E~0)) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse16 (and (= 1 ~t1_pc~0) (not .cse2) (not (= ~M_E~0 0)) .cse8 .cse9 (not .cse3) .cse18 .cse10 (not .cse13) .cse19 (not (= ~E_M~0 1)))) (.cse14 (not .cse7)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse15 (not (<= .cse20 |old(~token~0)|))) (.cse17 (not (<= |old(~token~0)| .cse20))) (.cse0 (= 1 ~E_M~0)) (.cse4 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse6 (= 0 ~E_M~0)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse3 .cse14 .cse11 .cse13 .cse0 .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse17 .cse6 .cse12) (or .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 (not (<= |old(~local~0)| |old(~token~0)|)) .cse11 .cse13 .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 .cse6 .cse12) (or .cse3 .cse14 .cse11 .cse13 .cse0 (and .cse8 .cse18 .cse10 .cse19) .cse1 .cse2 .cse4 .cse15 .cse5 .cse6 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= 0 ~t1_st~0) .cse9 .cse10) .cse11 .cse12 .cse13 (not (= |old(~t1_st~0)| 0)))))) [2019-09-16 16:41:01,740 INFO L443 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2019-09-16 16:41:01,741 INFO L439 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse19 (+ |old(~local~0)| 1)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse12 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= ~m_pc~0 1))) (.cse1 (= ~T1_E~0 0)) (.cse13 (not .cse17)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse7 (not (<= .cse19 |old(~token~0)|))) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 ~E_M~0)) (.cse10 (not (<= |old(~token~0)| .cse19)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) .cse2 .cse3 (and .cse14 .cse0 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse4 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 (and (= 0 ~t1_st~0) .cse0 .cse16) .cse2 .cse12 .cse3 (not (= |old(~t1_st~0)| 0))) (or .cse4 .cse5 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 .cse2 .cse12 .cse3 (and .cse14 .cse0 .cse16)) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse18 (+ ~local~0 1))) (and (<= ~token~0 .cse18) .cse14 .cse15 (<= .cse18 ~token~0) .cse16)) .cse9 .cse11 .cse10)))) [2019-09-16 16:41:01,741 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-09-16 16:41:01,741 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2019-09-16 16:41:01,741 INFO L439 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (<= ~token~0 ~local~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= 0 |old(~M_E~0)|)) (.cse4 (= 1 |old(~M_E~0)|)) (.cse17 (not (= ~t1_st~0 0))) (.cse5 (= 1 ~E_M~0)) (.cse7 (= ~T1_E~0 1)) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (= 0 ~E_M~0)) (.cse0 (= ~M_E~0 |old(~M_E~0)|)) (.cse14 (= 1 ~m_pc~0))) (and (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse9 ~token~0)) .cse10 .cse11 (not (<= ~token~0 .cse9)) .cse12)) (or .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 .cse0 .cse12 .cse13 .cse3 .cse4) (or .cse5 .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse0 .cse3 .cse14 .cse4) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse11 .cse0 .cse12 .cse14) (or .cse1 .cse15 .cse16 .cse13 .cse3 .cse4 .cse17 .cse5 .cse7 .cse10 .cse11 .cse0 .cse12) (or .cse5 .cse7 .cse1 .cse10 .cse11 .cse12 .cse2 .cse13 .cse0 .cse3 .cse4 .cse17) (or .cse1 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse0 .cse14) (or .cse1 .cse15 .cse16 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse0 .cse14))) [2019-09-16 16:41:01,741 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2019-09-16 16:41:01,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:41:01,742 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2019-09-16 16:41:01,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:41:01,742 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse25 (= |old(~t1_pc~0)| 1)) (.cse32 (+ |old(~local~0)| 1)) (.cse9 (= 1 ~t1_pc~0))) (let ((.cse19 (= ~m_st~0 0)) (.cse26 (not .cse9)) (.cse11 (<= 2 ~t1_st~0)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse18 (not (= 0 |old(~m_st~0)|))) (.cse28 (not (<= .cse32 |old(~token~0)|))) (.cse29 (not (<= |old(~token~0)| .cse32))) (.cse20 (not (= ~m_pc~0 1))) (.cse24 (= 1 |old(~m_pc~0)|)) (.cse3 (= ~T1_E~0 0)) (.cse16 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not .cse25)) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 |old(~E_M~0)|)) (.cse2 (= ~T1_E~0 1)) (.cse4 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse10 (<= 2 ~m_st~0)) (.cse31 (= 0 ~t1_st~0)) (.cse21 (= |old(~token~0)| ~token~0)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (<= ~token~0 ~local~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse23 (<= ~local~0 ~token~0)) (.cse7 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or .cse3 .cse16 .cse6 .cse17 .cse14 .cse15 .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse7 (and .cse9 .cse19 .cse11 .cse20 .cse21 .cse12 .cse22 .cse13 .cse23) .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 (and .cse26 .cse10 .cse20 .cse12 .cse13) .cse8 .cse14 .cse24 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse20 .cse12 .cse13) .cse14 .cse24 .cse15) (or (let ((.cse27 (+ ~local~0 1))) (and .cse9 (<= ~token~0 .cse27) .cse19 .cse11 .cse21 (<= .cse27 ~token~0) .cse12 .cse13)) .cse3 .cse6 .cse14 .cse15 .cse0 .cse1 .cse2 .cse18 .cse28 .cse4 .cse5 .cse29 .cse7) (or .cse3 .cse16 .cse17 .cse25 .cse14 .cse15 .cse30 .cse0 .cse2 .cse18 .cse4 .cse5 .cse7 (and .cse26 .cse19 .cse31 .cse20 .cse21 .cse12 .cse22 .cse13 .cse23) .cse24) (or .cse3 .cse25 .cse14 .cse15 .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 (and .cse26 .cse19 .cse11 .cse20 .cse12 .cse13) .cse7 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 .cse8 (and .cse26 .cse10 .cse31 .cse12 .cse13) .cse14 .cse15 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse26 .cse10 .cse11 .cse12 .cse13) .cse7 .cse25 .cse8 .cse14 .cse15) (or .cse3 .cse14 .cse15 .cse0 .cse1 .cse2 .cse18 .cse28 .cse4 .cse5 .cse29 .cse7 .cse20 .cse24) (or .cse3 .cse16 .cse6 .cse17 .cse8 .cse14 .cse15 .cse30 .cse0 .cse2 .cse4 .cse5 (and .cse9 .cse10 .cse31 .cse21 .cse12 .cse22 .cse13 .cse23) .cse7)))) [2019-09-16 16:41:01,742 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-09-16 16:41:01,742 INFO L443 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-09-16 16:41:01,743 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-09-16 16:41:01,743 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-09-16 16:41:01,743 INFO L439 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse17 (= 1 ~M_E~0)) (.cse21 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0))) (let ((.cse41 (not .cse1)) (.cse38 (not .cse21)) (.cse39 (not (= ~M_E~0 0))) (.cse40 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_1~0 0))) (.cse42 (not .cse17)) (.cse43 (not (= ~E_M~0 1))) (.cse9 (not (= ~E_1~0 1))) (.cse45 (= 1 ~t1_pc~0))) (let ((.cse5 (= |old(~t1_pc~0)| 1)) (.cse6 (not .cse45)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse33 (<= 2 ~m_st~0)) (.cse8 (= 0 ~t1_st~0)) (.cse37 (and (and .cse41 .cse45 .cse38 .cse39 .cse40 .cse13 .cse42 .cse43) .cse9)) (.cse7 (= ~m_st~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse2 (and .cse37 .cse7 .cse12 .cse36 .cse15 .cse10 .cse11)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (and .cse37 .cse12 .cse33 .cse8 .cse15)) (.cse25 (let ((.cse44 (+ ~local~0 1))) (and (<= ~token~0 .cse44) .cse37 .cse7 (<= .cse44 ~token~0) .cse36))) (.cse35 (and .cse6 .cse33 .cse36 .cse9 .cse41 .cse13 .cse14)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse29 (= 1 |old(~m_pc~0)|)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse28 (and .cse38 .cse6 .cse33 .cse39 .cse40 .cse8 .cse9 .cse41 .cse13 .cse42 .cse14 .cse43)) (.cse0 (and .cse37 .cse33 .cse36)) (.cse30 (not .cse5)) (.cse34 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= 0 ~M_E~0)) (.cse20 (= 1 |old(~E_M~0)|)) (.cse31 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse24 (and .cse37 .cse33 .cse10)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (let ((.cse32 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse30 .cse16 .cse17 .cse19 .cse20 .cse31 .cse21 .cse22 (not (<= .cse32 |old(~token~0)|)) .cse23 .cse24 .cse25 .cse26 (not (<= |old(~token~0)| .cse32)) .cse27)) (or .cse1 (and .cse33 .cse9 .cse10 .cse13 .cse14) .cse34 .cse16 .cse17 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse29) (or .cse1 .cse5 .cse34 .cse35 .cse16 .cse17 .cse20 .cse31 .cse21 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse16 .cse17 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse20 .cse21 .cse1 .cse23 .cse24 .cse26 .cse30 .cse27 .cse34 .cse16 .cse29 .cse17) (or .cse1 .cse5 .cse35 .cse16 .cse17 .cse20 .cse31 .cse22 .cse21 .cse23 .cse24 .cse26 .cse27 (and .cse6 .cse7 .cse36 .cse9 .cse10 .cse13 .cse14) .cse29) (or .cse0 .cse1 .cse5 .cse34 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse30 .cse34 .cse16 .cse17 .cse20 .cse31 .cse21 .cse23 .cse24 .cse26 .cse27)))))) [2019-09-16 16:41:01,744 INFO L439 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse4 (= 1 ~M_E~0)) (.cse7 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0))) (let ((.cse31 (not .cse1)) (.cse29 (not .cse7)) (.cse30 (not (= ~M_E~0 0))) (.cse17 (not (= ~E_1~0 0))) (.cse32 (not .cse4)) (.cse33 (not (= ~E_M~0 1))) (.cse15 (not (= ~E_1~0 1))) (.cse35 (= 1 ~t1_pc~0))) (let ((.cse24 (not .cse35)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse16 (not (= ~m_pc~0 1))) (.cse21 (= |old(~t1_pc~0)| 1)) (.cse34 (and (and .cse31 .cse35 .cse29 .cse30 (not (= ~E_M~0 0)) .cse17 .cse32 .cse33) .cse15)) (.cse25 (<= ~token~0 ~local~0)) (.cse14 (<= 2 ~m_st~0)) (.cse26 (<= ~local~0 ~token~0))) (let ((.cse0 (and .cse34 .cse25 .cse14 .cse26)) (.cse22 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse23 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (= 0 |old(~m_st~0)|))) (.cse2 (not .cse21)) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse5 (= 1 |old(~E_M~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (and .cse34 .cse14 .cse16)) (.cse28 (and .cse29 .cse24 .cse14 .cse30 .cse15 .cse31 .cse17 .cse32 .cse18 .cse33)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_M~0)|))) (and (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse9 |old(~token~0)|)) .cse10 .cse11 .cse12 (not (<= |old(~token~0)| .cse9)) .cse13)) (or .cse1 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13 .cse20) (or .cse1 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse11 .cse12 .cse13 .cse20) (or .cse0 .cse1 .cse22 .cse23 .cse21 .cse3 (and .cse24 (= ~m_st~0 0) .cse15 .cse16 (= |old(~token~0)| ~token~0) .cse25 .cse17 .cse18 .cse26) .cse4 .cse27 .cse5 .cse7 .cse8 .cse10 .cse11 .cse28 .cse12 .cse13 .cse20) (or .cse0 .cse1 .cse22 .cse2 .cse23 .cse19 .cse3 .cse4 .cse27 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse22 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20) (or .cse5 .cse7 .cse1 .cse10 .cse11 .cse12 .cse2 .cse13 .cse19 .cse3 .cse20 .cse4) (or .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse19 .cse3 .cse4) (or .cse1 .cse21 .cse19 .cse3 .cse4 .cse27 .cse5 .cse7 .cse10 .cse11 .cse28 .cse12 .cse13)))))) [2019-09-16 16:41:01,744 INFO L439 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse17 (= 1 ~M_E~0)) (.cse21 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0))) (let ((.cse41 (not .cse1)) (.cse38 (not .cse21)) (.cse39 (not (= ~M_E~0 0))) (.cse40 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_1~0 0))) (.cse42 (not .cse17)) (.cse43 (not (= ~E_M~0 1))) (.cse9 (not (= ~E_1~0 1))) (.cse45 (= 1 ~t1_pc~0))) (let ((.cse5 (= |old(~t1_pc~0)| 1)) (.cse6 (not .cse45)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse33 (<= 2 ~m_st~0)) (.cse8 (= 0 ~t1_st~0)) (.cse37 (and (and .cse41 .cse45 .cse38 .cse39 .cse40 .cse13 .cse42 .cse43) .cse9)) (.cse7 (= ~m_st~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse2 (and .cse37 .cse7 .cse12 .cse36 .cse15 .cse10 .cse11)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (and .cse37 .cse12 .cse33 .cse8 .cse15)) (.cse25 (let ((.cse44 (+ ~local~0 1))) (and (<= ~token~0 .cse44) .cse37 .cse7 (<= .cse44 ~token~0) .cse36))) (.cse35 (and .cse6 .cse33 .cse36 .cse9 .cse41 .cse13 .cse14)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse29 (= 1 |old(~m_pc~0)|)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse28 (and .cse38 .cse6 .cse33 .cse39 .cse40 .cse8 .cse9 .cse41 .cse13 .cse42 .cse14 .cse43)) (.cse0 (and .cse37 .cse33 .cse36)) (.cse30 (not .cse5)) (.cse34 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= 0 ~M_E~0)) (.cse20 (= 1 |old(~E_M~0)|)) (.cse31 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse24 (and .cse37 .cse33 .cse10)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (let ((.cse32 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse30 .cse16 .cse17 .cse19 .cse20 .cse31 .cse21 .cse22 (not (<= .cse32 |old(~token~0)|)) .cse23 .cse24 .cse25 .cse26 (not (<= |old(~token~0)| .cse32)) .cse27)) (or .cse1 (and .cse33 .cse9 .cse10 .cse13 .cse14) .cse34 .cse16 .cse17 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse29) (or .cse1 .cse5 .cse34 .cse35 .cse16 .cse17 .cse20 .cse31 .cse21 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse16 .cse17 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse20 .cse21 .cse1 .cse23 .cse24 .cse26 .cse30 .cse27 .cse34 .cse16 .cse29 .cse17) (or .cse1 .cse5 .cse35 .cse16 .cse17 .cse20 .cse31 .cse22 .cse21 .cse23 .cse24 .cse26 .cse27 (and .cse6 .cse7 .cse36 .cse9 .cse10 .cse13 .cse14) .cse29) (or .cse0 .cse1 .cse5 .cse34 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse30 .cse34 .cse16 .cse17 .cse20 .cse31 .cse21 .cse23 .cse24 .cse26 .cse27)))))) [2019-09-16 16:41:01,744 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2019-09-16 16:41:01,745 INFO L439 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse26 (= 1 ~t1_pc~0)) (.cse8 (= ~T1_E~0 1)) (.cse23 (not (= ~E_1~0 0))) (.cse5 (= 1 ~M_E~0)) (.cse21 (not (= ~E_1~0 1)))) (let ((.cse28 (and (and (not .cse0) .cse26 (not .cse8) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) .cse23 (not .cse5) (not (= ~E_M~0 1))) .cse21)) (.cse25 (<= 2 ~t1_st~0)) (.cse22 (not (= ~m_pc~0 1))) (.cse19 (= |old(~t1_pc~0)| 1))) (let ((.cse13 (not .cse19)) (.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse17 (and .cse28 (<= ~token~0 ~local~0) .cse25 (<= ~local~0 ~token~0) .cse22 (= |old(~token~0)| ~token~0))) (.cse2 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse10 (let ((.cse27 (+ ~local~0 1))) (and (<= ~token~0 .cse27) .cse28 (<= .cse27 ~token~0) .cse25))) (.cse15 (not (= 0 |old(~m_st~0)|))) (.cse20 (not .cse26)) (.cse24 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse18 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse0 .cse13 .cse4 .cse5 .cse7 .cse14 .cse8 .cse15 (not (<= .cse16 |old(~token~0)|)) .cse9 .cse10 .cse11 (not (<= |old(~token~0)| .cse16)) .cse12)) (or .cse0 .cse1 .cse17 .cse13 .cse2 .cse4 .cse5 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse18) (or .cse0 .cse1 .cse17 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse18 (and .cse20 (= 0 ~t1_st~0) .cse21 .cse22 .cse23 .cse24)) (or .cse0 .cse19 .cse4 .cse5 .cse7 .cse14 .cse15 .cse8 (and .cse20 .cse25 .cse21 .cse22 .cse23 .cse24) .cse9 .cse11 .cse12 .cse18) (or .cse7 .cse8 .cse0 .cse9 .cse11 .cse12 .cse19 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse14 .cse8 .cse0 .cse9 .cse11 .cse12 .cse3 .cse4 .cse5) (or .cse7 .cse8 .cse0 .cse9 .cse11 .cse12 .cse3 .cse4 .cse18 .cse5))))) [2019-09-16 16:41:01,745 INFO L443 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2019-09-16 16:41:01,746 INFO L439 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse17 (= 1 ~M_E~0)) (.cse21 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0))) (let ((.cse41 (not .cse1)) (.cse38 (not .cse21)) (.cse39 (not (= ~M_E~0 0))) (.cse40 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_1~0 0))) (.cse42 (not .cse17)) (.cse43 (not (= ~E_M~0 1))) (.cse9 (not (= ~E_1~0 1))) (.cse45 (= 1 ~t1_pc~0))) (let ((.cse5 (= |old(~t1_pc~0)| 1)) (.cse6 (not .cse45)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse33 (<= 2 ~m_st~0)) (.cse8 (= 0 ~t1_st~0)) (.cse37 (and (and .cse41 .cse45 .cse38 .cse39 .cse40 .cse13 .cse42 .cse43) .cse9)) (.cse7 (= ~m_st~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse2 (and .cse37 .cse7 .cse12 .cse36 .cse15 .cse10 .cse11)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (and .cse37 .cse12 .cse33 .cse8 .cse15)) (.cse25 (let ((.cse44 (+ ~local~0 1))) (and (<= ~token~0 .cse44) .cse37 .cse7 (<= .cse44 ~token~0) .cse36))) (.cse35 (and .cse6 .cse33 .cse36 .cse9 .cse41 .cse13 .cse14)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse29 (= 1 |old(~m_pc~0)|)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse28 (and .cse38 .cse6 .cse33 .cse39 .cse40 .cse8 .cse9 .cse41 .cse13 .cse42 .cse14 .cse43)) (.cse0 (and .cse37 .cse33 .cse36)) (.cse30 (not .cse5)) (.cse34 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= 0 ~M_E~0)) (.cse20 (= 1 |old(~E_M~0)|)) (.cse31 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse24 (and .cse37 .cse33 .cse10)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (let ((.cse32 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse30 .cse16 .cse17 .cse19 .cse20 .cse31 .cse21 .cse22 (not (<= .cse32 |old(~token~0)|)) .cse23 .cse24 .cse25 .cse26 (not (<= |old(~token~0)| .cse32)) .cse27)) (or .cse1 (and .cse33 .cse9 .cse10 .cse13 .cse14) .cse34 .cse16 .cse17 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse29) (or .cse1 .cse5 .cse34 .cse35 .cse16 .cse17 .cse20 .cse31 .cse21 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse16 .cse17 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse34 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse20 .cse21 .cse1 .cse23 .cse24 .cse26 .cse30 .cse27 .cse34 .cse16 .cse29 .cse17) (or .cse1 .cse5 .cse35 .cse16 .cse17 .cse20 .cse31 .cse22 .cse21 .cse23 .cse24 .cse26 .cse27 (and .cse6 .cse7 .cse36 .cse9 .cse10 .cse13 .cse14) .cse29) (or .cse0 .cse1 .cse5 .cse34 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse30 .cse34 .cse16 .cse17 .cse20 .cse31 .cse21 .cse23 .cse24 .cse26 .cse27)))))) [2019-09-16 16:41:01,746 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-09-16 16:41:01,746 INFO L446 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2019-09-16 16:41:01,746 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-09-16 16:41:01,746 INFO L446 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2019-09-16 16:41:01,746 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2019-09-16 16:41:01,746 INFO L443 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2019-09-16 16:41:01,746 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2019-09-16 16:41:01,747 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2019-09-16 16:41:01,747 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2019-09-16 16:41:01,747 INFO L446 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2019-09-16 16:41:01,747 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse12 (= 1 ~m_pc~0)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse4 (= 1 |old(~E_M~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse1 (= ~t1_pc~0 1)) (.cse17 (not (<= 2 ~m_st~0))) (.cse10 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (= 0 |old(~M_E~0)|)) (.cse3 (= 1 |old(~M_E~0)|)) (.cse16 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (or .cse10 .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 (not (<= .cse13 ~token~0)) .cse8 .cse9 (not (<= ~token~0 .cse13)) .cse11)) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse3 .cse16 .cse4 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse17 .cse10 .cse2 .cse12 .cse3) (or .cse0 .cse14 .cse15 .cse17 .cse2 .cse3 .cse16 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse5 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse17 .cse2 .cse3) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse1 .cse17 .cse10 .cse2 .cse3 .cse16))) [2019-09-16 16:41:01,747 INFO L443 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-09-16 16:41:01,747 INFO L443 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-09-16 16:41:01,748 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2019-09-16 16:41:01,748 INFO L443 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2019-09-16 16:41:01,748 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-09-16 16:41:01,748 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-09-16 16:41:01,748 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 (<= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (= 0 |old(~E_M~0)|) (and .cse0 .cse1 (= 0 ~t1_st~0) .cse2 (= |old(~token~0)| ~token~0) .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:41:01,748 INFO L439 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,748 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2019-09-16 16:41:01,749 INFO L439 ceAbstractionStarter]: At program point L411-1(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,749 INFO L439 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,749 INFO L439 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (not (= ~M_E~0 0))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (not (= ~E_1~0 1))) (.cse16 (= 1 ~t1_pc~0))) (let ((.cse6 (not (= ~m_pc~0 1))) (.cse12 (= |old(~token~0)| ~token~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse14 (not .cse16)) (.cse2 (<= 2 ~m_st~0)) (.cse13 (= 0 ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse11 (and (not (= ~E_M~0 0)) (and .cse16 (not (= ~T1_E~0 0)) (not (= ~T1_E~0 1)) .cse0 .cse1 .cse3 (not (= ~E_M~0 1))) .cse4))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse8 .cse2 .cse13 .cse10 .cse11) (and .cse14 .cse7 .cse1 .cse9 .cse4 .cse6 .cse0 .cse3 .cse5) (= 1 |old(~E_1~0)|) (and .cse2 .cse11 .cse6) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse14 .cse7 .cse1 .cse13 .cse4 .cse6 .cse12 .cse0 .cse8 .cse3 .cse5 .cse10) (and .cse2 .cse9 .cse11) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5) (= 0 |old(~E_1~0)|) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (= 0 |old(~E_M~0)|) (let ((.cse15 (+ ~local~0 1))) (and (<= ~token~0 .cse15) .cse7 (<= .cse15 ~token~0) .cse9 .cse11)) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,750 INFO L439 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,750 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,751 INFO L439 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,751 INFO L439 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,751 INFO L443 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2019-09-16 16:41:01,751 INFO L439 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,751 INFO L443 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2019-09-16 16:41:01,752 INFO L439 ceAbstractionStarter]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,752 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,752 INFO L439 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse6 (= ~m_st~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 (<= 2 ~m_st~0) .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 |old(~E_1~0)|) (and .cse0 .cse6 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 |old(~E_M~0)|) (and .cse0 .cse6 (= 0 ~t1_st~0) .cse1 (= |old(~token~0)| ~token~0) .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:41:01,752 INFO L439 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 (<= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (= 0 |old(~E_M~0)|) (and .cse0 .cse1 (= 0 ~t1_st~0) .cse2 (= |old(~token~0)| ~token~0) .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:41:01,753 INFO L439 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (not (= ~M_E~0 0))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (not (= ~E_1~0 1))) (.cse16 (= 1 ~t1_pc~0))) (let ((.cse6 (not (= ~m_pc~0 1))) (.cse12 (= |old(~token~0)| ~token~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse14 (not .cse16)) (.cse2 (<= 2 ~m_st~0)) (.cse13 (= 0 ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse11 (and (not (= ~E_M~0 0)) (and .cse16 (not (= ~T1_E~0 0)) (not (= ~T1_E~0 1)) .cse0 .cse1 .cse3 (not (= ~E_M~0 1))) .cse4))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse8 .cse2 .cse13 .cse10 .cse11) (and .cse14 .cse7 .cse1 .cse9 .cse4 .cse6 .cse0 .cse3 .cse5) (= 1 |old(~E_1~0)|) (and .cse2 .cse11 .cse6) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse14 .cse7 .cse1 .cse13 .cse4 .cse6 .cse12 .cse0 .cse8 .cse3 .cse5 .cse10) (and .cse2 .cse9 .cse11) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5) (= 0 |old(~E_1~0)|) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (= 0 |old(~E_M~0)|) (let ((.cse15 (+ ~local~0 1))) (and (<= ~token~0 .cse15) .cse7 (<= .cse15 ~token~0) .cse9 .cse11)) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,753 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-09-16 16:41:01,753 INFO L439 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,753 INFO L443 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2019-09-16 16:41:01,754 INFO L439 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (not (= 1 ~M_E~0))) (.cse14 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse15 (not (= ~E_1~0 1)))) (let ((.cse6 (and (and (not (= ~E_M~0 0)) (and .cse11 (and .cse12 .cse13 .cse14) (not (= ~E_M~0 1)))) .cse15)) (.cse3 (= ~m_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse2 (= 0 ~t1_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse11 (and (not .cse12) .cse13 .cse14) .cse15 (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse2) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2 .cse8) (and .cse6 .cse0 .cse5) (and .cse6 .cse0 .cse4) (let ((.cse9 (+ ~local~0 1))) (and (<= ~token~0 .cse9) .cse6 .cse3 (<= .cse9 ~token~0) .cse4)) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5 .cse10) (and .cse0 .cse1 .cse5) (and .cse3 .cse7 .cse1 .cse2 .cse8 .cse5 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse4) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:41:01,754 INFO L439 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (= ~M_E~0 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:41:01,754 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-09-16 16:41:01,754 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-09-16 16:41:01,755 INFO L439 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse12 (not (<= .cse20 ~token~0))) (.cse13 (not (<= ~token~0 .cse20))) (.cse17 (not (= 0 ~m_st~0))) (.cse5 (= 1 ~E_1~0)) (.cse8 (not (<= 2 ~m_st~0))) (.cse16 (not (= ~t1_st~0 0))) (.cse15 (= 1 ~m_pc~0)) (.cse0 (= 1 ~E_M~0)) (.cse2 (not (<= 2 ~t1_st~0))) (.cse3 (= ~T1_E~0 1)) (.cse4 (= ~T1_E~0 0)) (.cse18 (not (<= ~token~0 ~local~0))) (.cse6 (= 0 ~E_1~0)) (.cse10 (not .cse14)) (.cse19 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 ~E_M~0)) (.cse1 (= 0 is_master_triggered_~__retres1~0)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse4 .cse0 .cse10 .cse8 .cse1 .cse9 .cse11 .cse3 .cse5 .cse12 .cse6 .cse7 .cse13) (or .cse0 .cse3 .cse4 .cse1 .cse6 .cse7 .cse14 .cse9 .cse15 .cse11 .cse16) (or .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9 .cse15 .cse11) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse15) (or .cse4 .cse10 .cse1 .cse9 .cse0 .cse2 .cse17 .cse3 .cse5 .cse12 .cse6 .cse7 .cse13) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse14 .cse9 .cse15) (or .cse4 .cse18 .cse19 .cse8 .cse9 .cse16 .cse1 .cse0 .cse3 .cse5 .cse6 .cse7) (or .cse4 .cse1 .cse18 .cse19 .cse9 .cse0 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse15) (or .cse4 .cse1 .cse18 .cse19 .cse14 .cse9 .cse16 .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse15) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 .cse14 .cse8 .cse9 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse1 .cse6 .cse7 .cse14 .cse9 .cse15 .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse18 .cse6 .cse10 .cse19 .cse7 .cse1 .cse9 .cse11)))) [2019-09-16 16:41:01,755 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2019-09-16 16:41:01,755 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-09-16 16:41:01,755 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-09-16 16:41:01,755 INFO L443 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-09-16 16:41:01,755 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2019-09-16 16:41:01,755 INFO L446 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2019-09-16 16:41:01,755 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:41:01,756 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~T1_E~0 1)) (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not (= ~T1_E~0 0)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (not (= 1 ~M_E~0)) (<= ~local~0 ~token~0) (not (= ~E_M~0 1))) [2019-09-16 16:41:01,756 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:41:01,756 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:41:01,756 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2019-09-16 16:41:01,756 INFO L443 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-09-16 16:41:01,756 INFO L439 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse5 (not (= ~t1_st~0 0))) (.cse1 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= ~local~0 ~token~0))) (.cse3 (= ~t1_pc~0 1)) (.cse9 (not (= 0 ~m_st~0))) (.cse13 (= 1 ~m_pc~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse15 (not (<= 2 ~t1_st~0))) (.cse8 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse6 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse14 (not (<= 2 ~m_st~0))) (.cse4 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse7 .cse8 .cse0 .cse6 .cse10 .cse11 .cse12 .cse3 .cse14 .cse4 .cse5) (or .cse7 .cse15 .cse9 .cse8 .cse0 .cse10 .cse11 .cse6 .cse12 .cse3 .cse4 .cse13) (or .cse0 .cse6 .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse6 .cse4 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse16 (+ ~local~0 1))) (or .cse0 (not .cse3) .cse4 .cse7 .cse15 .cse9 .cse8 .cse10 (not (<= .cse16 ~token~0)) .cse6 .cse11 .cse12 (not (<= ~token~0 .cse16)))) (or .cse7 .cse8 .cse0 .cse6 .cse10 .cse11 .cse12 .cse14 .cse4 .cse13) (or .cse7 .cse15 .cse8 .cse0 .cse10 .cse6 .cse11 .cse12 .cse14 .cse4))) [2019-09-16 16:41:01,756 INFO L443 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2019-09-16 16:41:01,757 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-09-16 16:41:01,757 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-09-16 16:41:01,757 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2019-09-16 16:41:01,757 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2019-09-16 16:41:01,757 INFO L446 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2019-09-16 16:41:01,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:41:01 BoogieIcfgContainer [2019-09-16 16:41:01,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:41:01,844 INFO L168 Benchmark]: Toolchain (without parser) took 47043.14 ms. Allocated memory was 133.7 MB in the beginning and 661.1 MB in the end (delta: 527.4 MB). Free memory was 89.1 MB in the beginning and 508.8 MB in the end (delta: -419.7 MB). Peak memory consumption was 548.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:41:01,845 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 133.7 MB. Free memory is still 107.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 16:41:01,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.23 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 175.8 MB in the end (delta: -86.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:41:01,846 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 200.8 MB. Free memory was 175.8 MB in the beginning and 173.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:41:01,847 INFO L168 Benchmark]: RCFGBuilder took 607.77 ms. Allocated memory is still 200.8 MB. Free memory was 173.9 MB in the beginning and 143.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:41:01,850 INFO L168 Benchmark]: TraceAbstraction took 45941.54 ms. Allocated memory was 200.8 MB in the beginning and 661.1 MB in the end (delta: 460.3 MB). Free memory was 143.1 MB in the beginning and 508.8 MB in the end (delta: -365.8 MB). Peak memory consumption was 535.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:41:01,854 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 133.7 MB. Free memory is still 107.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.23 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 175.8 MB in the end (delta: -86.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 200.8 MB. Free memory was 175.8 MB in the beginning and 173.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 607.77 ms. Allocated memory is still 200.8 MB. Free memory was 173.9 MB in the beginning and 143.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45941.54 ms. Allocated memory was 200.8 MB in the beginning and 661.1 MB in the end (delta: 460.3 MB). Free memory was 143.1 MB in the beginning and 508.8 MB in the end (delta: -365.8 MB). Peak memory consumption was 535.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || ((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || (((((((((!(1 == t1_pc) && m_st == 0) && 0 == t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && \old(token) == token) && token <= local) && !(E_1 == 0)) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || 1 == \old(m_pc)) && ((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M))) && (((((((((((T1_E == 0 || ((((2 <= m_st && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || ((((((!(1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || ((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((T1_E == 0 || \old(t1_pc) == 1) || ((((((!(1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((!(1 == t1_pc) && m_st == 0) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || 1 == \old(m_pc))) && (((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1)))) && ((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == E_M || 0 == __retres1) || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) && ((((((((((((T1_E == 0 || 1 == E_M) || !(t1_pc == 1)) || !(2 <= m_st)) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || !(local + 1 <= token)) || 0 == E_1) || 0 == E_M) || !(token <= local + 1))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || !(t1_st == 0))) && ((((((((((T1_E == 1 || T1_E == 0) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || !(t1_pc == 1)) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || !(local + 1 <= token)) || 0 == E_1) || 0 == E_M) || !(token <= local + 1))) && (((((((((((1 == E_M || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc)) && (((((((((((T1_E == 0 || !(token <= local)) || !(local <= token)) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M)) && ((((((((((((T1_E == 0 || 0 == __retres1) || !(token <= local)) || !(local <= token)) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && (((((((((((((T1_E == 0 || 0 == __retres1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || 0 == E_M) || t1_pc == 1) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0))) && ((((((((((1 == E_M || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((1 == E_M || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || !(token <= local)) || 0 == E_1) || !(t1_pc == 1)) || !(local <= token)) || 0 == E_M) || 0 == __retres1) || 0 == M_E) || 1 == M_E) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || ((((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || !(\old(local) + 1 <= \old(token))) || 0 == \old(E_1)) || 0 == E_M) || !(\old(token) <= \old(local) + 1)) && (((((((((((1 == E_M || !(2 <= \old(t1_st))) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || (((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(E_1 == 0))) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((T1_E == 0 || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || !(\old(token) <= \old(local))) || ((((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || (((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0))) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || ((((m_st == 0 && !(E_M == 0)) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || 0 == \old(E_M)) || ((2 <= m_st && !(E_M == 0)) && !(E_M == 1))) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (2 <= m_st && E_M == \old(E_M))) || 0 == \old(E_M)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || ((2 <= m_st && !(E_M == 0)) && !(E_M == 1))) || 0 == E_1) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || (((m_st == 0 && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || ((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || (((((((((!(1 == t1_pc) && m_st == 0) && 0 == t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && \old(token) == token) && token <= local) && !(E_1 == 0)) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || 1 == \old(m_pc)) && ((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M))) && (((((((((((T1_E == 0 || ((((2 <= m_st && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || ((((((!(1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || ((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((token <= local + 1 && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((T1_E == 0 || \old(t1_pc) == 1) || ((((((!(1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((!(1 == t1_pc) && m_st == 0) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || 1 == \old(m_pc))) && (((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1)))) && ((((((((((((((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || ((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || (((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E)) && (((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || ((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == M_E) || ((((1 == t1_pc && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_M == 1))) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || ((((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || ((1 == t1_pc && 2 <= m_st) && E_M == \old(E_M))) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E)) && (((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || ((((1 == t1_pc && 2 <= m_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == E_1) || 0 == \old(E_M)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || !(\old(token) <= \old(local))) || ((2 <= m_st && ((\old(T1_E) == T1_E && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && 0 == t1_st)) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || (((m_st == 0 && ((\old(T1_E) == T1_E && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && 2 <= t1_st) && !(m_pc == 1))) || ((((((!(E_M == 0) && (\old(T1_E) == T1_E && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || ((((!(E_M == 0) && (\old(T1_E) == T1_E && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((!(E_M == 0) && (\old(T1_E) == T1_E && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((token <= local + 1 && (!(E_M == 0) && (\old(T1_E) == T1_E && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || ((((((((!(E_M == 0) && (\old(T1_E) == T1_E && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || ((2 <= m_st && ((\old(T1_E) == T1_E && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && !(m_pc == 1))) || ((((((m_st == 0 && token <= local) && ((\old(T1_E) == T1_E && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && 0 == t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || ((2 <= m_st && ((\old(T1_E) == T1_E && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && 2 <= t1_st)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((1 == E_M || !(2 <= \old(t1_st))) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || !(\old(local) + 1 <= \old(token))) || ((((token <= local + 1 && 2 <= t1_st) && \old(token) == token) && local + 1 <= token) && E_1 == \old(E_1))) || 0 == \old(E_1)) || 0 == E_M) || !(\old(token) <= \old(local) + 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || __retres1 == 0) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) || 1 == m_pc) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || __retres1 == 0) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || !(local + 1 <= token)) || 0 == E_1) || 0 == E_M) || !(token <= local + 1))) && ((((((((((1 == E_M || __retres1 == 0) || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((1 == E_M || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || __retres1 == 0) || 0 == M_E) || 1 == m_pc)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0))) && (((((((((((T1_E == 1 || T1_E == 0) || 0 == E_1) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || !(0 == m_st)) || 1 == E_1) || !(local + 1 <= token)) || __retres1 == 0) || 0 == E_M) || !(token <= local + 1))) && ((((((((((((T1_E == 0 || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || __retres1 == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || 1 == E_1) || !(2 <= t1_st)) || T1_E == 1) || 0 == E_1) || 0 == E_M)) && (((((((((((T1_E == 0 || !(token <= local)) || !(local <= token)) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || __retres1 == 0)) && (((((((((T1_E == 1 || T1_E == 0) || 0 == E_1) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 0 == E_M) || __retres1 == 0) || !(2 <= m_st))) && (((((((((1 == E_M || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || __retres1 == 0) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || !(t1_st == 0))) && ((((((((((((T1_E == 0 || __retres1 == 0) || !(token <= local)) || !(local <= token)) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && (((((((((((((T1_E == 0 || !(token <= local)) || !(local <= token)) || t1_pc == 1) || __retres1 == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((\old(T1_E) == 0 || !(M_E == 0)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((((!(m_pc == 1) || T1_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((T1_E == 0 || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || (((((2 <= t1_st && !(m_pc == 1)) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && local <= token)) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || ((0 == t1_st && !(m_pc == 1)) && E_1 == \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && (((((((((((1 == E_M || !(2 <= \old(t1_st))) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || ((2 <= t1_st && !(m_pc == 1)) && E_1 == \old(E_1)))) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || !(\old(local) + 1 <= \old(token))) || ((((token <= local + 1 && 2 <= t1_st) && \old(token) == token) && local + 1 <= token) && E_1 == \old(E_1))) || 0 == \old(E_1)) || 0 == E_M) || !(\old(token) <= \old(local) + 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. SAFE Result, 45.7s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 37.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2988 SDtfs, 3416 SDslu, 3002 SDs, 0 SdLazy, 2673 SolverSat, 1050 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 242 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 323 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 2020 PreInvPairs, 2555 NumberOfFragments, 21867 HoareAnnotationTreeSize, 2020 FomulaSimplifications, 147794 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 62 FomulaSimplificationsInter, 102845 FormulaSimplificationTreeSizeReductionInter, 34.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1574 NumberOfCodeBlocks, 1574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1558 ConstructedInterpolants, 0 QuantifiedInterpolants, 260954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 345/350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...