/usr/bin/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.25-86f66a4 [2020-07-07 11:35:20,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:35:20,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:35:20,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:35:20,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:35:20,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:35:20,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:35:20,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:35:20,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:35:20,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:35:20,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:35:20,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:35:20,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:35:20,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:35:20,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:35:20,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:35:20,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:35:20,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:35:20,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:35:20,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:35:20,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:35:20,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:35:20,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:35:20,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:35:20,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:35:20,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:35:20,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:35:20,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:35:20,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:35:20,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:35:20,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:35:20,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:35:20,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:35:20,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:35:20,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:35:20,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:35:20,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:35:20,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:35:20,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:35:20,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:35:20,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:35:20,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:35:20,875 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:35:20,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:35:20,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:35:20,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:35:20,877 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:35:20,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:35:20,877 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:35:20,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:35:20,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:35:20,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:35:20,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:35:20,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:35:20,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:35:20,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:35:20,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:35:20,879 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:35:20,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:35:20,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:35:20,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:35:20,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:35:20,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:35:20,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:35:20,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:35:20,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:35:20,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:35:20,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:35:20,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:35:20,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:35:20,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:35:20,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:35:21,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:35:21,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:35:21,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:35:21,166 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:35:21,167 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:35:21,168 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-07 11:35:21,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c589c97d0/c1a2c81f78b04774a10faca2105d5530/FLAG8c3713a6b [2020-07-07 11:35:21,752 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:35:21,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-07 11:35:21,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c589c97d0/c1a2c81f78b04774a10faca2105d5530/FLAG8c3713a6b [2020-07-07 11:35:22,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c589c97d0/c1a2c81f78b04774a10faca2105d5530 [2020-07-07 11:35:22,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:35:22,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:35:22,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:35:22,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:35:22,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:35:22,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b173b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22, skipping insertion in model container [2020-07-07 11:35:22,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:35:22,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:35:22,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:35:22,358 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:35:22,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:35:22,506 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:35:22,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22 WrapperNode [2020-07-07 11:35:22,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:35:22,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:35:22,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:35:22,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:35:22,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... [2020-07-07 11:35:22,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:35:22,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:35:22,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:35:22,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:35:22,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:35:22,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:35:22,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:35:22,608 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-07 11:35:22,608 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-07 11:35:22,608 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-07 11:35:22,608 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-07 11:35:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-07 11:35:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-07 11:35:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-07 11:35:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-07 11:35:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-07 11:35:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-07 11:35:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-07 11:35:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-07 11:35:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-07 11:35:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-07 11:35:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-07 11:35:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-07 11:35:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-07 11:35:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-07 11:35:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:35:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:35:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-07 11:35:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-07 11:35:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-07 11:35:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-07 11:35:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:35:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-07 11:35:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-07 11:35:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-07 11:35:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-07 11:35:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-07 11:35:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-07 11:35:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-07 11:35:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-07 11:35:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:35:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:35:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:35:23,117 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:35:23,117 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-07 11:35:23,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:35:23 BoogieIcfgContainer [2020-07-07 11:35:23,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:35:23,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:35:23,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:35:23,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:35:23,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:35:22" (1/3) ... [2020-07-07 11:35:23,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edf60ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:35:23, skipping insertion in model container [2020-07-07 11:35:23,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:22" (2/3) ... [2020-07-07 11:35:23,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edf60ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:35:23, skipping insertion in model container [2020-07-07 11:35:23,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:35:23" (3/3) ... [2020-07-07 11:35:23,133 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-07 11:35:23,142 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:35:23,150 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:35:23,164 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:35:23,191 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:35:23,191 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:35:23,191 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:35:23,192 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:35:23,192 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:35:23,192 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:35:23,192 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:35:23,192 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:35:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-07 11:35:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:23,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:23,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:23,232 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-07 11:35:23,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:23,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652272519] [2020-07-07 11:35:23,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:23,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652272519] [2020-07-07 11:35:23,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:23,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:35:23,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449888367] [2020-07-07 11:35:23,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:35:23,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:35:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:23,824 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 9 states. [2020-07-07 11:35:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:26,081 INFO L93 Difference]: Finished difference Result 501 states and 755 transitions. [2020-07-07 11:35:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:35:26,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2020-07-07 11:35:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:26,119 INFO L225 Difference]: With dead ends: 501 [2020-07-07 11:35:26,120 INFO L226 Difference]: Without dead ends: 357 [2020-07-07 11:35:26,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:35:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-07-07 11:35:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2020-07-07 11:35:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-07 11:35:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2020-07-07 11:35:26,220 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 77 [2020-07-07 11:35:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:26,221 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2020-07-07 11:35:26,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:35:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2020-07-07 11:35:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:26,225 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:26,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:26,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:35:26,226 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2125445556, now seen corresponding path program 1 times [2020-07-07 11:35:26,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:26,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936744251] [2020-07-07 11:35:26,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:26,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936744251] [2020-07-07 11:35:26,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:26,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:26,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553271500] [2020-07-07 11:35:26,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:26,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:26,491 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 10 states. [2020-07-07 11:35:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:27,734 INFO L93 Difference]: Finished difference Result 573 states and 802 transitions. [2020-07-07 11:35:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:35:27,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-07 11:35:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:27,747 INFO L225 Difference]: With dead ends: 573 [2020-07-07 11:35:27,750 INFO L226 Difference]: Without dead ends: 348 [2020-07-07 11:35:27,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:35:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-07-07 11:35:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244. [2020-07-07 11:35:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-07 11:35:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2020-07-07 11:35:27,801 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 77 [2020-07-07 11:35:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:27,801 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2020-07-07 11:35:27,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2020-07-07 11:35:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:27,804 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:27,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:27,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:35:27,804 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash -676620532, now seen corresponding path program 1 times [2020-07-07 11:35:27,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:27,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278596690] [2020-07-07 11:35:27,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:28,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278596690] [2020-07-07 11:35:28,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:28,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:28,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748993741] [2020-07-07 11:35:28,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:28,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:28,051 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand 10 states. [2020-07-07 11:35:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:29,700 INFO L93 Difference]: Finished difference Result 696 states and 1012 transitions. [2020-07-07 11:35:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:35:29,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-07 11:35:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:29,706 INFO L225 Difference]: With dead ends: 696 [2020-07-07 11:35:29,706 INFO L226 Difference]: Without dead ends: 471 [2020-07-07 11:35:29,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:35:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-07-07 11:35:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 296. [2020-07-07 11:35:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-07 11:35:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2020-07-07 11:35:29,760 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 77 [2020-07-07 11:35:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:29,761 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2020-07-07 11:35:29,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2020-07-07 11:35:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:29,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:29,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:29,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:35:29,767 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-07 11:35:29,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:29,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983614366] [2020-07-07 11:35:29,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:29,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983614366] [2020-07-07 11:35:29,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:29,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:29,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583924765] [2020-07-07 11:35:29,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:29,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:29,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:29,985 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 10 states. [2020-07-07 11:35:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:31,347 INFO L93 Difference]: Finished difference Result 718 states and 955 transitions. [2020-07-07 11:35:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:35:31,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-07 11:35:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:31,352 INFO L225 Difference]: With dead ends: 718 [2020-07-07 11:35:31,353 INFO L226 Difference]: Without dead ends: 442 [2020-07-07 11:35:31,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-07 11:35:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-07-07 11:35:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 316. [2020-07-07 11:35:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-07-07 11:35:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2020-07-07 11:35:31,393 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 77 [2020-07-07 11:35:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:31,394 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2020-07-07 11:35:31,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2020-07-07 11:35:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:31,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:31,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:31,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:35:31,396 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2020-07-07 11:35:31,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:31,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065436263] [2020-07-07 11:35:31,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:31,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065436263] [2020-07-07 11:35:31,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:31,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:31,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319395258] [2020-07-07 11:35:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:31,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:31,571 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand 10 states. [2020-07-07 11:35:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:32,859 INFO L93 Difference]: Finished difference Result 748 states and 981 transitions. [2020-07-07 11:35:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:35:32,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-07 11:35:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:32,865 INFO L225 Difference]: With dead ends: 748 [2020-07-07 11:35:32,866 INFO L226 Difference]: Without dead ends: 452 [2020-07-07 11:35:32,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:35:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-07-07 11:35:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2020-07-07 11:35:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-07-07 11:35:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2020-07-07 11:35:32,922 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 77 [2020-07-07 11:35:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:32,923 INFO L479 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2020-07-07 11:35:32,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2020-07-07 11:35:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:32,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:32,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:32,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:35:32,928 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-07 11:35:32,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:32,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752894979] [2020-07-07 11:35:32,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:33,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752894979] [2020-07-07 11:35:33,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:33,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:33,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501699459] [2020-07-07 11:35:33,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:33,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:33,140 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand 10 states. [2020-07-07 11:35:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:34,639 INFO L93 Difference]: Finished difference Result 894 states and 1170 transitions. [2020-07-07 11:35:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 11:35:34,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-07 11:35:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:34,648 INFO L225 Difference]: With dead ends: 894 [2020-07-07 11:35:34,648 INFO L226 Difference]: Without dead ends: 587 [2020-07-07 11:35:34,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-07 11:35:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-07-07 11:35:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 362. [2020-07-07 11:35:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-07-07 11:35:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 422 transitions. [2020-07-07 11:35:34,691 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 422 transitions. Word has length 77 [2020-07-07 11:35:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:34,693 INFO L479 AbstractCegarLoop]: Abstraction has 362 states and 422 transitions. [2020-07-07 11:35:34,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 422 transitions. [2020-07-07 11:35:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-07 11:35:34,695 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:34,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:34,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:35:34,695 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-07 11:35:34,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:34,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149282178] [2020-07-07 11:35:34,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:34,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149282178] [2020-07-07 11:35:34,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:34,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:35:34,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057479078] [2020-07-07 11:35:34,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:35:34,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:34,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:35:34,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:35:34,869 INFO L87 Difference]: Start difference. First operand 362 states and 422 transitions. Second operand 7 states. [2020-07-07 11:35:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:36,186 INFO L93 Difference]: Finished difference Result 1180 states and 1487 transitions. [2020-07-07 11:35:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:35:36,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-07-07 11:35:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:36,194 INFO L225 Difference]: With dead ends: 1180 [2020-07-07 11:35:36,194 INFO L226 Difference]: Without dead ends: 838 [2020-07-07 11:35:36,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:35:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-07-07 11:35:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 736. [2020-07-07 11:35:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-07-07 11:35:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 896 transitions. [2020-07-07 11:35:36,274 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 896 transitions. Word has length 77 [2020-07-07 11:35:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:36,274 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 896 transitions. [2020-07-07 11:35:36,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:35:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 896 transitions. [2020-07-07 11:35:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-07 11:35:36,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:36,277 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:36,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:35:36,277 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2020-07-07 11:35:36,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:36,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451889234] [2020-07-07 11:35:36,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 11:35:36,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451889234] [2020-07-07 11:35:36,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917678503] [2020-07-07 11:35:36,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:36,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:35:36,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:35:36,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:35:36,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-07 11:35:36,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19791482] [2020-07-07 11:35:36,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:35:36,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:35:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:36,701 INFO L87 Difference]: Start difference. First operand 736 states and 896 transitions. Second operand 3 states. [2020-07-07 11:35:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:36,813 INFO L93 Difference]: Finished difference Result 2007 states and 2500 transitions. [2020-07-07 11:35:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:35:36,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-07 11:35:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:36,820 INFO L225 Difference]: With dead ends: 2007 [2020-07-07 11:35:36,821 INFO L226 Difference]: Without dead ends: 1018 [2020-07-07 11:35:36,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-07-07 11:35:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2020-07-07 11:35:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2020-07-07 11:35:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1236 transitions. [2020-07-07 11:35:36,936 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1236 transitions. Word has length 121 [2020-07-07 11:35:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:36,936 INFO L479 AbstractCegarLoop]: Abstraction has 1018 states and 1236 transitions. [2020-07-07 11:35:36,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:35:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1236 transitions. [2020-07-07 11:35:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-07 11:35:36,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:36,940 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:37,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-07 11:35:37,155 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1360925018, now seen corresponding path program 1 times [2020-07-07 11:35:37,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:37,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142540710] [2020-07-07 11:35:37,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-07 11:35:37,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142540710] [2020-07-07 11:35:37,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760995051] [2020-07-07 11:35:37,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:37,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:35:37,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:35:37,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:35:37,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:35:37,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029212058] [2020-07-07 11:35:37,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:35:37,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:37,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:35:37,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:37,570 INFO L87 Difference]: Start difference. First operand 1018 states and 1236 transitions. Second operand 3 states. [2020-07-07 11:35:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:37,734 INFO L93 Difference]: Finished difference Result 2446 states and 3135 transitions. [2020-07-07 11:35:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:35:37,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-07-07 11:35:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:37,750 INFO L225 Difference]: With dead ends: 2446 [2020-07-07 11:35:37,750 INFO L226 Difference]: Without dead ends: 1449 [2020-07-07 11:35:37,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-07-07 11:35:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1443. [2020-07-07 11:35:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2020-07-07 11:35:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1735 transitions. [2020-07-07 11:35:37,906 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1735 transitions. Word has length 156 [2020-07-07 11:35:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:37,908 INFO L479 AbstractCegarLoop]: Abstraction has 1443 states and 1735 transitions. [2020-07-07 11:35:37,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:35:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1735 transitions. [2020-07-07 11:35:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-07 11:35:37,913 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:37,913 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:38,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:38,128 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1238354593, now seen corresponding path program 1 times [2020-07-07 11:35:38,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:38,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249430820] [2020-07-07 11:35:38,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-07-07 11:35:38,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249430820] [2020-07-07 11:35:38,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826049239] [2020-07-07 11:35:38,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:38,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-07 11:35:38,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-07 11:35:38,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:35:38,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2020-07-07 11:35:38,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559351162] [2020-07-07 11:35:38,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:35:38,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:35:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:35:38,735 INFO L87 Difference]: Start difference. First operand 1443 states and 1735 transitions. Second operand 14 states. [2020-07-07 11:35:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:40,824 INFO L93 Difference]: Finished difference Result 2733 states and 3367 transitions. [2020-07-07 11:35:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:35:40,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 157 [2020-07-07 11:35:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:40,841 INFO L225 Difference]: With dead ends: 2733 [2020-07-07 11:35:40,842 INFO L226 Difference]: Without dead ends: 1765 [2020-07-07 11:35:40,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2020-07-07 11:35:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2020-07-07 11:35:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1598. [2020-07-07 11:35:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2020-07-07 11:35:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1910 transitions. [2020-07-07 11:35:41,038 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1910 transitions. Word has length 157 [2020-07-07 11:35:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:41,038 INFO L479 AbstractCegarLoop]: Abstraction has 1598 states and 1910 transitions. [2020-07-07 11:35:41,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:35:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1910 transitions. [2020-07-07 11:35:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-07 11:35:41,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:41,044 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:41,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 11:35:41,259 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash 846884099, now seen corresponding path program 1 times [2020-07-07 11:35:41,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:41,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207897499] [2020-07-07 11:35:41,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-07-07 11:35:41,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207897499] [2020-07-07 11:35:41,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77241515] [2020-07-07 11:35:41,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:41,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:35:41,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-07 11:35:41,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:35:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-07 11:35:41,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871351741] [2020-07-07 11:35:41,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:35:41,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:41,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:35:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:41,800 INFO L87 Difference]: Start difference. First operand 1598 states and 1910 transitions. Second operand 3 states. [2020-07-07 11:35:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:41,973 INFO L93 Difference]: Finished difference Result 3165 states and 3848 transitions. [2020-07-07 11:35:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:35:41,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-07 11:35:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:41,985 INFO L225 Difference]: With dead ends: 3165 [2020-07-07 11:35:41,986 INFO L226 Difference]: Without dead ends: 1588 [2020-07-07 11:35:41,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2020-07-07 11:35:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2020-07-07 11:35:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-07-07 11:35:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1864 transitions. [2020-07-07 11:35:42,131 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1864 transitions. Word has length 175 [2020-07-07 11:35:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:42,132 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 1864 transitions. [2020-07-07 11:35:42,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:35:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1864 transitions. [2020-07-07 11:35:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-07 11:35:42,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:42,136 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:42,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:42,351 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2020-07-07 11:35:42,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:42,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413704172] [2020-07-07 11:35:42,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-07 11:35:42,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413704172] [2020-07-07 11:35:42,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830330636] [2020-07-07 11:35:42,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:42,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:35:42,739 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-07 11:35:42,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:35:42,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:35:42,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73312622] [2020-07-07 11:35:42,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:35:42,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:35:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:42,768 INFO L87 Difference]: Start difference. First operand 1588 states and 1864 transitions. Second operand 3 states. [2020-07-07 11:35:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:42,932 INFO L93 Difference]: Finished difference Result 3618 states and 4277 transitions. [2020-07-07 11:35:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:35:42,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-07-07 11:35:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:42,940 INFO L225 Difference]: With dead ends: 3618 [2020-07-07 11:35:42,940 INFO L226 Difference]: Without dead ends: 1034 [2020-07-07 11:35:42,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2020-07-07 11:35:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2020-07-07 11:35:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2020-07-07 11:35:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1176 transitions. [2020-07-07 11:35:43,071 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1176 transitions. Word has length 176 [2020-07-07 11:35:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:43,072 INFO L479 AbstractCegarLoop]: Abstraction has 1034 states and 1176 transitions. [2020-07-07 11:35:43,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:35:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1176 transitions. [2020-07-07 11:35:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-07 11:35:43,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:43,077 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:43,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-07 11:35:43,292 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-07 11:35:43,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:43,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39055158] [2020-07-07 11:35:43,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-07 11:35:43,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39055158] [2020-07-07 11:35:43,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795740288] [2020-07-07 11:35:43,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:43,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-07 11:35:43,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-07 11:35:43,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:35:43,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-07 11:35:43,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186844654] [2020-07-07 11:35:43,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:35:43,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:35:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:35:43,920 INFO L87 Difference]: Start difference. First operand 1034 states and 1176 transitions. Second operand 12 states. [2020-07-07 11:35:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:46,053 INFO L93 Difference]: Finished difference Result 1268 states and 1468 transitions. [2020-07-07 11:35:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 11:35:46,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2020-07-07 11:35:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:46,055 INFO L225 Difference]: With dead ends: 1268 [2020-07-07 11:35:46,055 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 11:35:46,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-07 11:35:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 11:35:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 11:35:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 11:35:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 11:35:46,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-07 11:35:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:46,060 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 11:35:46,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:35:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 11:35:46,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 11:35:46,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:46,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 11:35:46,975 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-07 11:35:47,098 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-07 11:35:47,308 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-07 11:35:47,491 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-07 11:35:47,655 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-07 11:35:58,405 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-07-07 11:35:59,470 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-07-07 11:35:59,862 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-07-07 11:36:00,436 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:00,990 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:01,102 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-07-07 11:36:01,636 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:02,170 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:02,815 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:03,962 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 164 DAG size of output: 82 [2020-07-07 11:36:04,539 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2020-07-07 11:36:05,604 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 169 DAG size of output: 58 [2020-07-07 11:36:06,006 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-07-07 11:36:06,649 WARN L193 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 57 [2020-07-07 11:36:07,719 WARN L193 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 82 [2020-07-07 11:36:08,396 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-07 11:36:08,962 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:11,135 WARN L193 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 180 DAG size of output: 98 [2020-07-07 11:36:11,397 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-07-07 11:36:11,939 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 53 [2020-07-07 11:36:12,134 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-07-07 11:36:14,338 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 180 DAG size of output: 98 [2020-07-07 11:36:14,689 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-07 11:36:15,236 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:17,488 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 180 DAG size of output: 98 [2020-07-07 11:36:17,694 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-07 11:36:17,995 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-07 11:36:18,642 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-07 11:36:18,970 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-07-07 11:36:19,295 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-07-07 11:36:19,608 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-07-07 11:36:20,454 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2020-07-07 11:36:20,784 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-07-07 11:36:21,482 WARN L193 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 62 [2020-07-07 11:36:22,103 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-07-07 11:36:22,656 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-07 11:36:23,543 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 57 [2020-07-07 11:36:24,035 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-07-07 11:36:24,449 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2020-07-07 11:36:24,813 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2020-07-07 11:36:24,915 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-07-07 11:36:25,171 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-07-07 11:36:25,274 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-07 11:36:25,660 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-07-07 11:36:25,762 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-07 11:36:25,762 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (= 1 ~m_pc~0)) (.cse8 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 (not (<= ~token~0 ~local~0)) .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse8 (not (<= ~local~0 ~token~0))) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse6 .cse2 .cse3 (not (<= .cse9 ~token~0)) .cse5 (not (<= ~token~0 .cse9)))) (or .cse1 .cse7 .cse2 .cse3 (not (<= ~t1_pc~0 0)) .cse4 .cse8))) [2020-07-07 11:36:25,763 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-07 11:36:25,763 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse17 (= 1 ~m_pc~0))) (let ((.cse2 (not .cse17)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= 2 ~E_M~0))) (let ((.cse16 (and .cse2 .cse9 .cse10 .cse5)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (<= |old(~t1_pc~0)| 0))) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (= 0 ~M_E~0)) (.cse8 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= |old(~token~0)| ~local~0)))) (and (let ((.cse4 (= 1 ~t1_pc~0))) (or .cse0 .cse1 .cse2 (let ((.cse3 (+ ~local~0 1))) (and (= 0 ~m_st~0) (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5)) .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse4 .cse5) .cse11 (not (= 1 |old(~t1_pc~0)|)) .cse12)) (or .cse0 .cse1 .cse13 (and .cse14 .cse9 .cse10 .cse15 (= |old(~token~0)| ~token~0)) .cse16 .cse7 .cse8 .cse11) (or .cse0 .cse1 .cse16 .cse7 .cse8 .cse17 .cse11) (or .cse0 .cse1 .cse13 (not (= 0 |old(~m_st~0)|)) (and .cse14 .cse9 .cse10 (<= ~token~0 ~local~0) .cse15 (<= ~local~0 ~token~0)) .cse6 .cse7 .cse8 .cse17 .cse12))))) [2020-07-07 11:36:25,764 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-07 11:36:25,764 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse8 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse2 (and .cse8 .cse9 .cse10 .cse12 (= |old(~token~0)| ~token~0))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6) (or .cse0 .cse1 .cse7 (not (= 0 |old(~m_st~0)|)) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse3 .cse4 .cse5 .cse15) (or .cse0 .cse1 .cse14 .cse3 .cse4 (and .cse9 .cse10 .cse11 (= 1 ~t1_pc~0) .cse12 .cse13) .cse6 (not (= 1 |old(~t1_pc~0)|)) .cse15)))) [2020-07-07 11:36:25,764 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-07 11:36:25,764 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse7 (= 1 ~m_pc~0)) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 .cse1 (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4 (= |old(~token~0)| ~token~0)) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse9 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse10 .cse5 .cse6 (and .cse2 .cse3 (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) .cse4 (<= ~local~0 ~token~0)) .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse11))) [2020-07-07 11:36:25,765 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-07 11:36:25,765 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse4 (= 1 ~m_pc~0)) (.cse8 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0))) (let ((.cse11 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (= 0 ~m_st~0)) (.cse14 (not (<= |old(~token~0)| ~local~0))) (.cse0 (not .cse17)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (and .cse17 (not .cse4) .cse8 .cse10))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse2 .cse3 (let ((.cse13 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse7 .cse8 .cse9)) .cse5 .cse6 (not (= 1 |old(~t1_pc~0)|)) .cse14) (or .cse0 .cse1 .cse15 (not (= 0 |old(~m_st~0)|)) .cse11 .cse2 .cse3 (and .cse12 (<= ~token~0 ~local~0) .cse7 .cse9 .cse16 (<= ~local~0 ~token~0)) .cse4 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse3 (and .cse7 .cse9 .cse16 .cse10) .cse5 .cse6)))) [2020-07-07 11:36:25,765 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse7 (+ ~local~0 1))) (and .cse5 .cse6 (<= ~token~0 .cse7) (<= .cse7 ~token~0) (= 1 ~t1_pc~0))) .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9) (or .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse11 .cse9) (or .cse0 (and .cse5 .cse6) .cse1 .cse3 .cse4 .cse11 .cse8) (or .cse0 .cse1 .cse10 .cse3 .cse4 .cse8))) [2020-07-07 11:36:25,765 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-07 11:36:25,765 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-07 11:36:25,765 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-07 11:36:25,766 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-07 11:36:25,766 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-07 11:36:25,766 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse7 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse12 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse11 .cse2 .cse3 .cse13 .cse14) (or .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12)))) [2020-07-07 11:36:25,766 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse12 (= 1 ~m_pc~0)) (.cse11 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (or .cse1 .cse0 .cse5 .cse6 .cse12 .cse7) (or .cse1 .cse0 .cse2 (and (= 0 ~m_st~0) (= 1 ~E_M~0)) .cse5 .cse6 .cse13 .cse7 .cse14) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse4 .cse10 .cse5 .cse6 .cse13 .cse14) (or .cse1 .cse4 .cse5 .cse6 .cse9 .cse12 .cse11)))) [2020-07-07 11:36:25,766 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-07 11:36:25,766 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse7 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse12 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse11 .cse2 .cse3 .cse13 .cse14) (or .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12)))) [2020-07-07 11:36:25,767 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-07 11:36:25,767 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-07 11:36:25,767 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-07 11:36:25,767 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-07 11:36:25,767 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-07 11:36:25,767 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-07 11:36:25,767 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-07 11:36:25,767 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-07 11:36:25,768 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-07 11:36:25,768 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-07 11:36:25,768 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse6 (= 1 ~m_pc~0)) (.cse7 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse9 (not (= 0 ~m_st~0))) (.cse2 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse4 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse4 .cse2 .cse5 .cse6) (or .cse7 .cse2 .cse4 .cse5 .cse8 .cse6 (= 0 ~E_1~0)) (or .cse0 .cse1 .cse9 (not (<= ~token~0 ~local~0)) .cse7 (not (<= 2 ~t1_st~0)) .cse2 .cse4 .cse5 .cse6 (not (<= ~local~0 ~token~0))) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse8) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse5 (not (<= .cse10 ~token~0)) (not (<= ~token~0 .cse10)))))) [2020-07-07 11:36:25,768 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-07 11:36:25,768 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-07 11:36:25,768 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-07 11:36:25,768 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-07 11:36:25,768 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-07 11:36:25,769 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-07 11:36:25,769 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-07 11:36:25,769 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-07 11:36:25,769 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-07 11:36:25,769 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-07 11:36:25,769 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-07 11:36:25,769 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) (not (= 0 |old(~m_st~0)|)) (not (<= ~token~0 ~local~0)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0) (not (<= ~local~0 ~token~0))) [2020-07-07 11:36:25,769 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-07 11:36:25,770 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~local~0 |old(~local~0)|) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,770 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-07 11:36:25,770 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-07 11:36:25,770 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-07 11:36:25,770 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~local~0 |old(~local~0)|) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,770 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,770 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-07 11:36:25,771 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-07 11:36:25,771 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-07 11:36:25,771 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-07 11:36:25,771 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-07 11:36:25,771 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-07 11:36:25,771 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse9 (+ |old(~local~0)| 1))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= |old(~token~0)| .cse9))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= .cse9 |old(~token~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= |old(~token~0)| ~token~0)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse8 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (or .cse1 .cse4 .cse5 .cse8 .cse6 (not (<= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7)))) [2020-07-07 11:36:25,772 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_1~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~m_st~0))) (let ((.cse8 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (and .cse12 .cse14 .cse6 .cse15 .cse13)) (.cse10 (and .cse12 (<= ~token~0 ~local~0) .cse15 (<= ~local~0 ~token~0) .cse13)) (.cse0 (not .cse15)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse14)) (.cse7 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse2 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 .cse9 .cse10) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse8 .cse0 (not (<= |old(~token~0)| .cse11)) .cse1 .cse2 .cse3 .cse5 (not (<= .cse11 |old(~token~0)|)) .cse9 .cse10)) (or (and .cse12 .cse13) .cse0 .cse2 .cse3 .cse4 .cse5 .cse7)))) [2020-07-07 11:36:25,772 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse7)) .cse2 .cse3 .cse4 .cse6 (not (<= .cse7 |old(~token~0)|)))) (or .cse1 .cse3 .cse4 .cse5 .cse6 (not (<= ~t1_pc~0 0))))) [2020-07-07 11:36:25,772 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse4 (= 1 |old(~m_pc~0)|)) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (and .cse7 .cse8 .cse9 .cse10 (= ~local~0 |old(~local~0)|) .cse11)) (.cse2 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0))) (or .cse6 .cse0 (and .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) .cse12 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse6 .cse0 (not (<= |old(~token~0)| .cse13)) .cse12 .cse1 .cse3 .cse2 .cse5 (not (<= .cse13 |old(~token~0)|))))))) [2020-07-07 11:36:25,772 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse16 (+ |old(~local~0)| 1)) (.cse15 (not (= 1 ~m_pc~0))) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (not (= 0 ~E_1~0))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0))) (let ((.cse13 (and .cse15 .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= |old(~token~0)| .cse16))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= .cse16 |old(~token~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (= 0 ~M_E~0)) (.cse14 (= 1 |old(~m_pc~0)|)) (.cse11 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse3 .cse9 (not (<= |old(~token~0)| |old(~local~0)|)) .cse10 .cse14 (not (<= |old(~local~0)| |old(~token~0)|)) .cse11) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse14 .cse11 .cse12) (or (and .cse15 .cse4 .cse5 .cse6) .cse1 .cse9 .cse10 .cse14 .cse11 (not (<= ~t1_pc~0 0)))))) [2020-07-07 11:36:25,772 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-07 11:36:25,773 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse4 (= 1 |old(~m_pc~0)|)) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (and .cse7 .cse8 .cse9 .cse10 (= ~local~0 |old(~local~0)|) .cse11)) (.cse2 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0))) (or .cse6 .cse0 (and .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) .cse12 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse6 .cse0 (not (<= |old(~token~0)| .cse13)) .cse12 .cse1 .cse3 .cse2 .cse5 (not (<= .cse13 |old(~token~0)|))))))) [2020-07-07 11:36:25,773 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-07 11:36:25,773 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-07 11:36:25,773 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse5 (not (<= 2 ~m_st~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (not (= 0 ~m_st~0))) (.cse10 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse9 (= 1 ~m_pc~0)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse0 .cse1 .cse10 .cse2 .cse4 .cse5 .cse6 .cse11 .cse7) (or .cse0 .cse1 .cse12 .cse10 .cse2 .cse4 .cse3 .cse6 .cse9 .cse11 .cse7) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse7) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 (not (<= .cse13 ~token~0)) (not (<= ~token~0 .cse13)) .cse7)) (or .cse0 .cse12 .cse10 .cse2 .cse4 .cse6 .cse8 .cse9 .cse11 .cse7))) [2020-07-07 11:36:25,773 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-07 11:36:25,773 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:36:25,774 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~token~0 |old(~token~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-07-07 11:36:25,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:36:25,774 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse22 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~local~0 |old(~local~0)|)) (.cse23 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (= ~E_M~0 |old(~E_M~0)|)) (.cse24 (<= ~local~0 ~token~0))) (let ((.cse19 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse24)) (.cse20 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse21 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse18 (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~E_M~0)|))) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (= 0 ~M_E~0)) (.cse12 (not (<= 2 ~T1_E~0))) (.cse14 (not (= 1 |old(~t1_pc~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse8 .cse15 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12 .cse18) (or .cse8 .cse19 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14) (or .cse8 .cse10 .cse11 .cse17 .cse12 .cse18 .cse13) (or .cse8 .cse15 .cse16 (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse24) .cse10 .cse20 .cse11 .cse17 .cse21 .cse12) (or .cse8 .cse16 .cse9 .cse19 .cse10 .cse20 .cse11 .cse17 .cse21 .cse12 .cse14) (or .cse8 .cse15 .cse10 .cse11 .cse12 .cse18 .cse13) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse16 (not (<= |old(~token~0)| .cse25)) .cse9 .cse10 .cse11 .cse12 (let ((.cse26 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 .cse26) .cse4 (<= .cse26 ~token~0) .cse5 .cse6)) (not (<= .cse25 |old(~token~0)|)) .cse14))))) [2020-07-07 11:36:25,774 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-07 11:36:25,774 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-07 11:36:25,775 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-07 11:36:25,775 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-07 11:36:25,775 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse35 (not (= 1 ~m_pc~0))) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= 0 ~m_st~0)) (.cse28 (<= 2 ~E_1~0)) (.cse29 (<= 2 ~T1_E~0)) (.cse30 (not .cse2)) (.cse18 (= 1 ~t1_pc~0)) (.cse31 (<= 2 ~E_M~0)) (.cse34 (<= 2 ~t1_st~0))) (let ((.cse23 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (let ((.cse36 (+ ~local~0 1))) (and .cse33 .cse28 .cse29 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse30 .cse18 .cse31 .cse34))) (.cse12 (and .cse28 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32)) (.cse24 (and .cse28 .cse29 .cse30 .cse18 .cse31 .cse34 .cse32)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse15 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse29)) (.cse5 (and .cse28 .cse35 .cse29 .cse30 .cse31 .cse32)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (= ~local~0 |old(~local~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0)) (or .cse8 .cse9 .cse10 .cse4 .cse11 .cse0 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse2 .cse1 .cse3 .cse5 .cse23 .cse24) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse4 .cse11 .cse0 .cse12 .cse22 (not (<= |old(~token~0)| .cse25)) .cse2 .cse1 .cse5 (not (<= .cse25 |old(~token~0)|)) .cse23 .cse24)) (or .cse11 .cse0 .cse12 .cse9 .cse2 .cse1 .cse10 .cse4 .cse5 .cse6 .cse23 .cse24) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 (and .cse13 .cse14 .cse16 .cse26 .cse18 .cse19 .cse21) .cse6 .cse23) (or (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) .cse9 .cse10 .cse4 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse32) .cse11 .cse0 .cse12 .cse7 .cse22 .cse2 .cse1 .cse3 .cse5 (and .cse33 .cse28 .cse29 .cse31 .cse34 .cse21 .cse35 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) .cse24) (or .cse0 .cse7 .cse22 .cse8 .cse1 .cse2 .cse3 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse34 .cse32) .cse4 (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse26 .cse19 .cse21) .cse5) (or .cse0 (and .cse16 .cse18 .cse34 .cse19 .cse32) .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse27 .cse13 .cse14 .cse16 .cse26 .cse19 .cse21)))))) [2020-07-07 11:36:25,776 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse26 (not (= 1 ~m_pc~0))) (.cse19 (<= 2 ~E_1~0)) (.cse20 (<= 2 ~T1_E~0)) (.cse23 (<= ~token~0 ~local~0)) (.cse27 (= 1 |old(~t1_pc~0)|)) (.cse21 (not .cse2)) (.cse24 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~E_M~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse16 (<= 2 ~m_st~0))) (let ((.cse10 (and .cse19 .cse20 .cse23 .cse27 .cse21 .cse24 .cse22 .cse25 .cse16)) (.cse11 (not .cse27)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse18 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not .cse20)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse7 (not (= 0 |old(~m_st~0)|))) (.cse13 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse5 (and .cse19 .cse26 .cse20 .cse21 .cse22 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse10 .cse1 .cse2 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)) .cse11)) (or .cse0 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse13 .cse14 .cse15 .cse16)) (or .cse0 .cse10 .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse7 .cse9 .cse10 .cse1 .cse17 .cse2 .cse3 .cse18 .cse4 .cse5 .cse11) (or .cse0 .cse12 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse17 .cse18 .cse4 (and .cse19 .cse13 .cse20 .cse21 .cse22 .cse16) .cse0 .cse12 .cse7 (and .cse19 .cse20 .cse23 .cse21 .cse24 .cse22 .cse25 .cse16) (and (= 0 ~m_st~0) .cse13 .cse26 .cse14 .cse23 .cse15 .cse25 (= |old(~token~0)| ~token~0)) .cse2 .cse1 .cse3 .cse5))))) [2020-07-07 11:36:25,776 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse35 (not (= 1 ~m_pc~0))) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= 0 ~m_st~0)) (.cse28 (<= 2 ~E_1~0)) (.cse29 (<= 2 ~T1_E~0)) (.cse30 (not .cse2)) (.cse18 (= 1 ~t1_pc~0)) (.cse31 (<= 2 ~E_M~0)) (.cse34 (<= 2 ~t1_st~0))) (let ((.cse23 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (let ((.cse36 (+ ~local~0 1))) (and .cse33 .cse28 .cse29 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse30 .cse18 .cse31 .cse34))) (.cse12 (and .cse28 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32)) (.cse24 (and .cse28 .cse29 .cse30 .cse18 .cse31 .cse34 .cse32)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse15 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse29)) (.cse5 (and .cse28 .cse35 .cse29 .cse30 .cse31 .cse32)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (= ~local~0 |old(~local~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0)) (or .cse8 .cse9 .cse10 .cse4 .cse11 .cse0 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse2 .cse1 .cse3 .cse5 .cse23 .cse24) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse4 .cse11 .cse0 .cse12 .cse22 (not (<= |old(~token~0)| .cse25)) .cse2 .cse1 .cse5 (not (<= .cse25 |old(~token~0)|)) .cse23 .cse24)) (or .cse11 .cse0 .cse12 .cse9 .cse2 .cse1 .cse10 .cse4 .cse5 .cse6 .cse23 .cse24) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 (and .cse13 .cse14 .cse16 .cse26 .cse18 .cse19 .cse21) .cse6 .cse23) (or (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) .cse9 .cse10 .cse4 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse32) .cse11 .cse0 .cse12 .cse7 .cse22 .cse2 .cse1 .cse3 .cse5 (and .cse33 .cse28 .cse29 .cse31 .cse34 .cse21 .cse35 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) .cse24) (or .cse0 .cse7 .cse22 .cse8 .cse1 .cse2 .cse3 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse34 .cse32) .cse4 (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse26 .cse19 .cse21) .cse5) (or .cse0 (and .cse16 .cse18 .cse34 .cse19 .cse32) .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse27 .cse13 .cse14 .cse16 .cse26 .cse19 .cse21)))))) [2020-07-07 11:36:25,776 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-07 11:36:25,777 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse28 (+ ~local~0 1))) (let ((.cse23 (<= 2 ~E_1~0)) (.cse24 (<= 2 ~T1_E~0)) (.cse26 (<= ~token~0 .cse28)) (.cse27 (<= .cse28 ~token~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~E_M~0)) (.cse15 (<= 2 ~t1_st~0))) (let ((.cse7 (not (= 0 |old(~m_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse22 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (not (= 1 ~m_pc~0))) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse6 (and .cse23 .cse24 .cse26 .cse27 .cse14 .cse25 .cse15)) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse19 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse21 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 ~M_E~0)) (.cse4 (not .cse24)) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 .cse8 .cse1 .cse9 .cse2 .cse3 .cse10 .cse4 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (let ((.cse20 (+ |old(~local~0)| 1))) (or .cse0 .cse6 .cse7 (not (<= |old(~token~0)| .cse20)) .cse8 .cse1 .cse2 .cse4 (not (<= .cse20 |old(~token~0)|)) .cse19)) (or .cse0 .cse21 .cse7 .cse8 (and .cse22 .cse11 .cse12 .cse15 .cse16) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse21 .cse7 .cse1 .cse9 .cse2 .cse3 .cse10 .cse4 (and .cse23 .cse22 .cse11 .cse24 .cse12 .cse25 .cse16) (and .cse23 .cse24 .cse26 .cse27 .cse14 .cse15 .cse25) (and .cse23 .cse11 .cse24 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse6 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse19) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse19) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5))))) [2020-07-07 11:36:25,777 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-07 11:36:25,777 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse35 (not (= 1 ~m_pc~0))) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= 0 ~m_st~0)) (.cse28 (<= 2 ~E_1~0)) (.cse29 (<= 2 ~T1_E~0)) (.cse30 (not .cse2)) (.cse18 (= 1 ~t1_pc~0)) (.cse31 (<= 2 ~E_M~0)) (.cse34 (<= 2 ~t1_st~0))) (let ((.cse23 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (let ((.cse36 (+ ~local~0 1))) (and .cse33 .cse28 .cse29 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse30 .cse18 .cse31 .cse34))) (.cse12 (and .cse28 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32)) (.cse24 (and .cse28 .cse29 .cse30 .cse18 .cse31 .cse34 .cse32)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse15 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse29)) (.cse5 (and .cse28 .cse35 .cse29 .cse30 .cse31 .cse32)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (= ~local~0 |old(~local~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0)) (or .cse8 .cse9 .cse10 .cse4 .cse11 .cse0 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse2 .cse1 .cse3 .cse5 .cse23 .cse24) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse4 .cse11 .cse0 .cse12 .cse22 (not (<= |old(~token~0)| .cse25)) .cse2 .cse1 .cse5 (not (<= .cse25 |old(~token~0)|)) .cse23 .cse24)) (or .cse11 .cse0 .cse12 .cse9 .cse2 .cse1 .cse10 .cse4 .cse5 .cse6 .cse23 .cse24) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 (and .cse13 .cse14 .cse16 .cse26 .cse18 .cse19 .cse21) .cse6 .cse23) (or (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) .cse9 .cse10 .cse4 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse32) .cse11 .cse0 .cse12 .cse7 .cse22 .cse2 .cse1 .cse3 .cse5 (and .cse33 .cse28 .cse29 .cse31 .cse34 .cse21 .cse35 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) .cse24) (or .cse0 .cse7 .cse22 .cse8 .cse1 .cse2 .cse3 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse34 .cse32) .cse4 (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse26 .cse19 .cse21) .cse5) (or .cse0 (and .cse16 .cse18 .cse34 .cse19 .cse32) .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse27 .cse13 .cse14 .cse16 .cse26 .cse19 .cse21)))))) [2020-07-07 11:36:25,777 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-07 11:36:25,778 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-07 11:36:25,778 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-07 11:36:25,778 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-07 11:36:25,778 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-07 11:36:25,778 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-07 11:36:25,778 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-07 11:36:25,778 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-07 11:36:25,778 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-07 11:36:25,779 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-07 11:36:25,779 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-07 11:36:25,779 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-07 11:36:25,779 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-07 11:36:25,779 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-07 11:36:25,779 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-07 11:36:25,779 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-07 11:36:25,780 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-07 11:36:25,780 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse2 .cse4 .cse3 .cse5 .cse6 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,780 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,780 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-07 11:36:25,780 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,781 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse6 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~m_st~0)) (.cse8 (<= 2 ~t1_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (not (= 0 ~M_E~0))) (.cse7 (<= 2 ~E_M~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse15 (<= ~t1_pc~0 0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse4 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 .cse4) (<= .cse4 ~token~0) .cse5 .cse6 .cse7 .cse8)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse5 .cse7 .cse14) (and .cse1 .cse9 .cse2 .cse3 .cse5 .cse7 .cse14) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11 .cse14) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse13 .cse9 .cse2 .cse3 .cse5 .cse7 .cse8 .cse15) (and .cse0 .cse1 .cse13 .cse9 .cse2 .cse3 .cse10 .cse5 .cse7 .cse11 .cse15 .cse12) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,781 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,781 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,782 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,782 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,782 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,782 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-07 11:36:25,783 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,783 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-07 11:36:25,783 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,783 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,784 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse2 .cse4 .cse3 .cse5 .cse6 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,784 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse2 .cse4 .cse3 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,784 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,784 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-07 11:36:25,785 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,785 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-07 11:36:25,785 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-07 11:36:25,785 INFO L264 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (= 0 ~M_E~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-07 11:36:25,785 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-07 11:36:25,786 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-07 11:36:25,786 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse10 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= .cse15 ~token~0))) (.cse8 (not (<= ~token~0 .cse15))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 ~t1_st~0))) (.cse12 (= 0 ~E_1~0)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse4 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse11 (= 1 ~m_pc~0)) (.cse7 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0)))) (and (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (or .cse2 .cse4 .cse5 .cse10 .cse11 .cse12 .cse7) (or .cse0 .cse1 (= 1 ~E_M~0) .cse9 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse13 .cse2 .cse9 .cse4 .cse5 .cse14 .cse7) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse14) (or .cse0 .cse9 .cse4 .cse5 .cse11 .cse7)))) [2020-07-07 11:36:25,786 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-07 11:36:25,786 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-07 11:36:25,786 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-07 11:36:25,786 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-07 11:36:25,786 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-07 11:36:25,787 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-07 11:36:25,787 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:36:25,787 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~m_pc~0)) (<= 2 ~T1_E~0) (<= ~token~0 ~local~0) (<= 2 ~E_M~0) (<= 2 ~M_E~0) (<= ~local~0 ~token~0) (<= ~t1_pc~0 0)) [2020-07-07 11:36:25,787 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 11:36:25,787 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:36:25,787 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-07 11:36:25,787 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-07 11:36:25,788 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-07 11:36:25,788 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-07 11:36:25,788 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-07 11:36:25,788 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-07 11:36:25,788 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-07 11:36:25,788 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-07 11:36:25,788 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 0 ~m_st~0)) (not (<= ~token~0 ~local~0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0) (not (<= ~local~0 ~token~0))) [2020-07-07 11:36:25,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:36:25 BoogieIcfgContainer [2020-07-07 11:36:25,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:36:25,859 INFO L168 Benchmark]: Toolchain (without parser) took 63779.30 ms. Allocated memory was 143.1 MB in the beginning and 864.0 MB in the end (delta: 720.9 MB). Free memory was 101.2 MB in the beginning and 149.1 MB in the end (delta: -47.9 MB). Peak memory consumption was 739.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:25,860 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-07 11:36:25,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.57 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 178.7 MB in the end (delta: -77.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:25,861 INFO L168 Benchmark]: Boogie Preprocessor took 43.47 ms. Allocated memory is still 200.8 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:25,862 INFO L168 Benchmark]: RCFGBuilder took 573.45 ms. Allocated memory is still 200.8 MB. Free memory was 176.6 MB in the beginning and 144.7 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:25,863 INFO L168 Benchmark]: TraceAbstraction took 62732.14 ms. Allocated memory was 200.8 MB in the beginning and 864.0 MB in the end (delta: 663.2 MB). Free memory was 144.7 MB in the beginning and 149.1 MB in the end (delta: -4.4 MB). Peak memory consumption was 725.6 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:25,866 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 425.57 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 178.7 MB in the end (delta: -77.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.47 ms. Allocated memory is still 200.8 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 573.45 ms. Allocated memory is still 200.8 MB. Free memory was 176.6 MB in the beginning and 144.7 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62732.14 ms. Allocated memory was 200.8 MB in the beginning and 864.0 MB in the end (delta: 663.2 MB). Free memory was 144.7 MB in the beginning and 149.1 MB in the end (delta: -4.4 MB). Peak memory consumption was 725.6 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: (((((((((((((!(2 <= \old(E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || t1_pc <= 0)) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || ((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((((!(2 <= \old(t1_st)) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || !(\old(token) <= \old(local) + 1)) || 0 == M_E) || !(2 <= \old(E_1))) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && (((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(token) <= \old(local))) || 0 == M_E) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && 1 == t1_pc) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((((((((((((((((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && E_M == \old(E_M)) && local <= token) && \old(token) == token) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 2 <= E_M) && 2 <= t1_st) && \old(token) == token) && !(1 == m_pc)) && E_1 == \old(E_1)) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || ((((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= T1_E)) || (((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || ((((E_1 == \old(E_1) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || ((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1)) && ((((((!(2 <= E_1) || !(2 <= E_M)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0))) && (((((((!(2 <= E_1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0))) && ((((((!(2 <= E_M) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 1 == m_pc) || 0 == E_1) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1))) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= E_M)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local <= token)) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((!(1 == t1_pc) || !(token <= local)) || !(2 <= E_M)) || !(2 <= t1_st)) || 0 == M_E) || !(2 <= T1_E)) || 0 == E_1) || (0 <= __retres1 && __retres1 <= 0)) || !(local <= token))) && (((((!(2 <= E_1) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || (0 <= __retres1 && __retres1 <= 0)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) && ((((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st))) && (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st))) && (((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(1 == m_pc)) || ((((0 == m_st && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= E_M)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((m_st == \old(m_st) && \old(t1_st) == t1_st) && 1 == t1_pc) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((!(1 == m_pc) && m_st == \old(m_st)) && \old(t1_st) == t1_st) && 2 <= E_M)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((!(1 == m_pc) && m_st == \old(m_st)) && \old(t1_st) == t1_st) && 2 <= E_M)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st)))) && (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(\old(token) <= local)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || t1_pc <= 0)) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || ((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((((!(2 <= \old(t1_st)) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || !(\old(token) <= \old(local) + 1)) || 0 == M_E) || !(2 <= \old(E_1))) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && (((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(token) <= \old(local))) || 0 == M_E) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && 1 == t1_pc) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((((((((((((((((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && E_M == \old(E_M)) && local <= token) && \old(token) == token) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 2 <= E_M) && 2 <= t1_st) && \old(token) == token) && !(1 == m_pc)) && E_1 == \old(E_1)) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || ((((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= T1_E)) || (((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || ((((E_1 == \old(E_1) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || ((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) && ((((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((1 == t1_pc && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((0 == m_st && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || !(\old(token) <= local))) && (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((0 == m_st && token <= local) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc) || !(\old(token) <= local))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || (((1 == t1_pc && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(\old(token) <= local))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1 && \old(t1_pc) == t1_pc) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st) || ((((((((0 == m_st && 2 <= E_1) && \old(T1_E) == T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(\old(token) <= \old(local))) || (((((2 <= E_1 && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) <= \old(token))) || ((((((2 <= E_1 && \old(T1_E) == T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((((0 == m_st && 2 <= E_1) && !(1 == m_pc)) && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && local <= token) && \old(token) == token)) || !(2 <= \old(E_M))) || (((((((0 == m_st && 2 <= E_1) && \old(t1_pc) == t1_pc) && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st)) || (((((((2 <= E_1 && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((((((0 == m_st && 2 <= E_1) && \old(t1_pc) == t1_pc) && !(1 == m_pc)) && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 2 <= E_M) && local <= token) && \old(token) == token)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E))) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(1 == t1_pc)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) && (((((!(2 <= E_1) || !(2 <= m_st)) || 0 == M_E) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || 1 == m_pc)) && ((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 1 == m_pc) || 0 == E_1)) && ((((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(token <= local)) || !(2 <= E_M)) || !(2 <= t1_st)) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(local <= token))) && ((((((!(2 <= E_1) || !(2 <= E_M)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0))) && (((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || !(token <= local + 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(0 == M_E)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(2 <= E_M) || !(2 <= \old(E_1))) || 0 == M_E) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) && (((((((((!(1 == t1_pc) || !(2 <= E_M)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(token) == token)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.0s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2269 SDtfs, 5496 SDslu, 1065 SDs, 0 SdLazy, 8914 SolverSat, 2964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1571 GetRequests, 1372 SyntacticMatches, 6 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1598occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1144 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3649 PreInvPairs, 4853 NumberOfFragments, 13170 HoareAnnotationTreeSize, 3649 FomulaSimplifications, 25623323 FormulaSimplificationTreeSizeReduction, 11.8s HoareSimplificationTime, 62 FomulaSimplificationsInter, 497283 FormulaSimplificationTreeSizeReductionInter, 27.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2442 ConstructedInterpolants, 0 QuantifiedInterpolants, 747441 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3947 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 873/1000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...