/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 --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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-79ed534 [2020-07-19 23:54:17,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 23:54:17,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 23:54:17,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 23:54:17,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 23:54:17,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 23:54:17,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 23:54:17,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 23:54:17,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 23:54:17,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 23:54:17,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 23:54:17,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 23:54:17,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 23:54:17,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 23:54:17,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 23:54:17,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 23:54:17,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 23:54:17,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 23:54:17,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 23:54:17,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 23:54:17,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 23:54:17,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 23:54:17,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 23:54:17,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 23:54:17,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 23:54:17,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 23:54:17,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 23:54:17,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 23:54:17,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 23:54:17,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 23:54:17,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 23:54:17,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 23:54:17,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 23:54:17,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 23:54:17,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 23:54:17,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 23:54:17,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 23:54:17,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 23:54:17,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 23:54:17,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 23:54:17,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 23:54:17,793 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-19 23:54:17,809 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 23:54:17,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 23:54:17,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 23:54:17,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 23:54:17,811 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 23:54:17,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 23:54:17,812 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 23:54:17,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 23:54:17,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 23:54:17,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 23:54:17,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 23:54:17,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 23:54:17,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 23:54:17,813 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 23:54:17,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 23:54:17,813 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 23:54:17,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 23:54:17,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 23:54:17,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 23:54:17,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 23:54:17,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 23:54:17,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 23:54:17,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 23:54:17,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 23:54:17,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 23:54:17,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 23:54:17,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 23:54:17,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 23:54:17,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 23:54:17,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-19 23:54:18,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 23:54:18,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 23:54:18,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 23:54:18,154 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 23:54:18,154 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 23:54:18,155 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-19 23:54:18,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac406f141/95bae550a44d4094af07f9c89c2adcce/FLAGb0a2c5ef7 [2020-07-19 23:54:18,744 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 23:54:18,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-19 23:54:18,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac406f141/95bae550a44d4094af07f9c89c2adcce/FLAGb0a2c5ef7 [2020-07-19 23:54:19,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac406f141/95bae550a44d4094af07f9c89c2adcce [2020-07-19 23:54:19,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 23:54:19,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 23:54:19,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 23:54:19,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 23:54:19,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 23:54:19,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f36b8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19, skipping insertion in model container [2020-07-19 23:54:19,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 23:54:19,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 23:54:19,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:54:19,356 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 23:54:19,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:54:19,523 INFO L208 MainTranslator]: Completed translation [2020-07-19 23:54:19,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19 WrapperNode [2020-07-19 23:54:19,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 23:54:19,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 23:54:19,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 23:54:19,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 23:54:19,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (1/1) ... [2020-07-19 23:54:19,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 23:54:19,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 23:54:19,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 23:54:19,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 23:54:19,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (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-19 23:54:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 23:54:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 23:54:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-19 23:54:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-19 23:54:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-19 23:54:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-19 23:54:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-19 23:54:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-19 23:54:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-19 23:54:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-19 23:54:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-19 23:54:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-19 23:54:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-19 23:54:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-19 23:54:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-19 23:54:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-19 23:54:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-19 23:54:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-19 23:54:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-19 23:54:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-19 23:54:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 23:54:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 23:54:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-19 23:54:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-19 23:54:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-19 23:54:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-19 23:54:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 23:54:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-19 23:54:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-19 23:54:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-19 23:54:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-19 23:54:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-19 23:54:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-19 23:54:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-19 23:54:19,659 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-19 23:54:19,659 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-19 23:54:19,659 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-19 23:54:19,659 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-19 23:54:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-19 23:54:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-19 23:54:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-19 23:54:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 23:54:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 23:54:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 23:54:20,221 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 23:54:20,222 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-19 23:54:20,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:54:20 BoogieIcfgContainer [2020-07-19 23:54:20,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 23:54:20,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 23:54:20,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 23:54:20,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 23:54:20,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:54:19" (1/3) ... [2020-07-19 23:54:20,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859e257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:54:20, skipping insertion in model container [2020-07-19 23:54:20,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:54:19" (2/3) ... [2020-07-19 23:54:20,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859e257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:54:20, skipping insertion in model container [2020-07-19 23:54:20,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:54:20" (3/3) ... [2020-07-19 23:54:20,244 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-19 23:54:20,255 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 23:54:20,262 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 23:54:20,275 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 23:54:20,305 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 23:54:20,305 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 23:54:20,305 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 23:54:20,306 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 23:54:20,306 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 23:54:20,306 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 23:54:20,307 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 23:54:20,307 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 23:54:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-19 23:54:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:20,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:20,346 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-19 23:54:20,347 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-19 23:54:20,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:20,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16629353] [2020-07-19 23:54:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:21,079 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-19 23:54:21,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16629353] [2020-07-19 23:54:21,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:21,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 23:54:21,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873634004] [2020-07-19 23:54:21,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 23:54:21,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 23:54:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:54:21,117 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 9 states. [2020-07-19 23:54:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:23,483 INFO L93 Difference]: Finished difference Result 501 states and 755 transitions. [2020-07-19 23:54:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 23:54:23,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2020-07-19 23:54:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:23,508 INFO L225 Difference]: With dead ends: 501 [2020-07-19 23:54:23,509 INFO L226 Difference]: Without dead ends: 357 [2020-07-19 23:54:23,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-19 23:54:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-07-19 23:54:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2020-07-19 23:54:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-19 23:54:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2020-07-19 23:54:23,656 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 77 [2020-07-19 23:54:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:23,656 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2020-07-19 23:54:23,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 23:54:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2020-07-19 23:54:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:23,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:23,666 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-19 23:54:23,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 23:54:23,668 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2125445556, now seen corresponding path program 1 times [2020-07-19 23:54:23,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:23,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800837017] [2020-07-19 23:54:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:23,881 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-19 23:54:23,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800837017] [2020-07-19 23:54:23,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:23,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:54:23,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560216801] [2020-07-19 23:54:23,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:54:23,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:54:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:23,886 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 10 states. [2020-07-19 23:54:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:25,052 INFO L93 Difference]: Finished difference Result 573 states and 802 transitions. [2020-07-19 23:54:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 23:54:25,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 23:54:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:25,058 INFO L225 Difference]: With dead ends: 573 [2020-07-19 23:54:25,059 INFO L226 Difference]: Without dead ends: 348 [2020-07-19 23:54:25,062 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-19 23:54:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-07-19 23:54:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244. [2020-07-19 23:54:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-19 23:54:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2020-07-19 23:54:25,111 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 77 [2020-07-19 23:54:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:25,112 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2020-07-19 23:54:25,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:54:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2020-07-19 23:54:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:25,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:25,115 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-19 23:54:25,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 23:54:25,115 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash -676620532, now seen corresponding path program 1 times [2020-07-19 23:54:25,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:25,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011833929] [2020-07-19 23:54:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:25,339 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-19 23:54:25,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011833929] [2020-07-19 23:54:25,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:25,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:54:25,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990077099] [2020-07-19 23:54:25,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:54:25,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:54:25,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:25,342 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand 10 states. [2020-07-19 23:54:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:26,947 INFO L93 Difference]: Finished difference Result 696 states and 1012 transitions. [2020-07-19 23:54:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-19 23:54:26,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 23:54:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:26,955 INFO L225 Difference]: With dead ends: 696 [2020-07-19 23:54:26,956 INFO L226 Difference]: Without dead ends: 471 [2020-07-19 23:54:26,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-19 23:54:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-07-19 23:54:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 296. [2020-07-19 23:54:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-19 23:54:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2020-07-19 23:54:27,046 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 77 [2020-07-19 23:54:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:27,049 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2020-07-19 23:54:27,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:54:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2020-07-19 23:54:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:27,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:27,059 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-19 23:54:27,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 23:54:27,060 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:27,060 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-19 23:54:27,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:27,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697260181] [2020-07-19 23:54:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:27,276 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-19 23:54:27,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697260181] [2020-07-19 23:54:27,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:27,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:54:27,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942644192] [2020-07-19 23:54:27,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:54:27,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:54:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:27,281 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 10 states. [2020-07-19 23:54:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:28,703 INFO L93 Difference]: Finished difference Result 718 states and 955 transitions. [2020-07-19 23:54:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 23:54:28,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 23:54:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:28,715 INFO L225 Difference]: With dead ends: 718 [2020-07-19 23:54:28,715 INFO L226 Difference]: Without dead ends: 442 [2020-07-19 23:54:28,719 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-19 23:54:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-07-19 23:54:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 316. [2020-07-19 23:54:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-07-19 23:54:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2020-07-19 23:54:28,781 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 77 [2020-07-19 23:54:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:28,782 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2020-07-19 23:54:28,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:54:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2020-07-19 23:54:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:28,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:28,786 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-19 23:54:28,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 23:54:28,791 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2020-07-19 23:54:28,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:28,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129413999] [2020-07-19 23:54:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:29,078 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-19 23:54:29,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129413999] [2020-07-19 23:54:29,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:29,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:54:29,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105153383] [2020-07-19 23:54:29,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:54:29,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:54:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:29,080 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand 10 states. [2020-07-19 23:54:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:30,550 INFO L93 Difference]: Finished difference Result 748 states and 981 transitions. [2020-07-19 23:54:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 23:54:30,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 23:54:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:30,554 INFO L225 Difference]: With dead ends: 748 [2020-07-19 23:54:30,554 INFO L226 Difference]: Without dead ends: 452 [2020-07-19 23:54:30,556 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-19 23:54:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-07-19 23:54:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2020-07-19 23:54:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-07-19 23:54:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2020-07-19 23:54:30,592 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 77 [2020-07-19 23:54:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:30,593 INFO L479 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2020-07-19 23:54:30,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:54:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2020-07-19 23:54:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:30,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:30,595 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-19 23:54:30,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 23:54:30,595 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-19 23:54:30,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:30,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041886394] [2020-07-19 23:54:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:30,803 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-19 23:54:30,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041886394] [2020-07-19 23:54:30,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:30,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:54:30,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991669869] [2020-07-19 23:54:30,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:54:30,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:30,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:54:30,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:30,806 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand 10 states. [2020-07-19 23:54:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:32,580 INFO L93 Difference]: Finished difference Result 894 states and 1170 transitions. [2020-07-19 23:54:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-19 23:54:32,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 23:54:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:32,588 INFO L225 Difference]: With dead ends: 894 [2020-07-19 23:54:32,588 INFO L226 Difference]: Without dead ends: 587 [2020-07-19 23:54:32,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-19 23:54:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-07-19 23:54:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 362. [2020-07-19 23:54:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-07-19 23:54:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 422 transitions. [2020-07-19 23:54:32,649 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 422 transitions. Word has length 77 [2020-07-19 23:54:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:32,652 INFO L479 AbstractCegarLoop]: Abstraction has 362 states and 422 transitions. [2020-07-19 23:54:32,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:54:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 422 transitions. [2020-07-19 23:54:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 23:54:32,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:32,654 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-19 23:54:32,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 23:54:32,655 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-19 23:54:32,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:32,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823941422] [2020-07-19 23:54:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:32,865 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-19 23:54:32,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823941422] [2020-07-19 23:54:32,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:54:32,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-19 23:54:32,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909483494] [2020-07-19 23:54:32,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 23:54:32,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 23:54:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-19 23:54:32,871 INFO L87 Difference]: Start difference. First operand 362 states and 422 transitions. Second operand 7 states. [2020-07-19 23:54:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:34,436 INFO L93 Difference]: Finished difference Result 1180 states and 1487 transitions. [2020-07-19 23:54:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 23:54:34,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-07-19 23:54:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:34,449 INFO L225 Difference]: With dead ends: 1180 [2020-07-19 23:54:34,449 INFO L226 Difference]: Without dead ends: 838 [2020-07-19 23:54:34,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-19 23:54:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-07-19 23:54:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 736. [2020-07-19 23:54:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-07-19 23:54:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 896 transitions. [2020-07-19 23:54:34,536 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 896 transitions. Word has length 77 [2020-07-19 23:54:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:34,537 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 896 transitions. [2020-07-19 23:54:34,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 23:54:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 896 transitions. [2020-07-19 23:54:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-19 23:54:34,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:34,541 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-19 23:54:34,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-19 23:54:34,542 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2020-07-19 23:54:34,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:34,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996593577] [2020-07-19 23:54:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:34,796 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-19 23:54:34,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996593577] [2020-07-19 23:54:34,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044473927] [2020-07-19 23:54:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1c0bdd49 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-19 23:54:34,905 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1c0bdd49 issued 1 check-sat command(s) [2020-07-19 23:54:34,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:54:34,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 23:54:34,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:54:35,002 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-19 23:54:35,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:54:35,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-19 23:54:35,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444047836] [2020-07-19 23:54:35,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:54:35,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:54:35,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:35,006 INFO L87 Difference]: Start difference. First operand 736 states and 896 transitions. Second operand 3 states. [2020-07-19 23:54:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:35,203 INFO L93 Difference]: Finished difference Result 2007 states and 2500 transitions. [2020-07-19 23:54:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:54:35,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-19 23:54:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:35,213 INFO L225 Difference]: With dead ends: 2007 [2020-07-19 23:54:35,214 INFO L226 Difference]: Without dead ends: 1018 [2020-07-19 23:54:35,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-07-19 23:54:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2020-07-19 23:54:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2020-07-19 23:54:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1236 transitions. [2020-07-19 23:54:35,375 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1236 transitions. Word has length 121 [2020-07-19 23:54:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:35,376 INFO L479 AbstractCegarLoop]: Abstraction has 1018 states and 1236 transitions. [2020-07-19 23:54:35,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:54:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1236 transitions. [2020-07-19 23:54:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-19 23:54:35,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:35,382 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-19 23:54:35,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-19 23:54:35,597 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:35,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1360925018, now seen corresponding path program 1 times [2020-07-19 23:54:35,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:35,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107905204] [2020-07-19 23:54:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:35,938 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-19 23:54:35,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107905204] [2020-07-19 23:54:35,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625837237] [2020-07-19 23:54:35,940 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@79719c34 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-19 23:54:36,074 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@79719c34 issued 3 check-sat command(s) [2020-07-19 23:54:36,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:54:36,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 23:54:36,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:54:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-19 23:54:36,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:54:36,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-19 23:54:36,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195776693] [2020-07-19 23:54:36,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:54:36,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:36,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:54:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:54:36,173 INFO L87 Difference]: Start difference. First operand 1018 states and 1236 transitions. Second operand 3 states. [2020-07-19 23:54:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:36,405 INFO L93 Difference]: Finished difference Result 2466 states and 3031 transitions. [2020-07-19 23:54:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:54:36,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-07-19 23:54:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:36,422 INFO L225 Difference]: With dead ends: 2466 [2020-07-19 23:54:36,422 INFO L226 Difference]: Without dead ends: 1468 [2020-07-19 23:54:36,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:54:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-07-19 23:54:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1456. [2020-07-19 23:54:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1456 states. [2020-07-19 23:54:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1754 transitions. [2020-07-19 23:54:36,625 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1754 transitions. Word has length 156 [2020-07-19 23:54:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:36,627 INFO L479 AbstractCegarLoop]: Abstraction has 1456 states and 1754 transitions. [2020-07-19 23:54:36,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:54:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1754 transitions. [2020-07-19 23:54:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-19 23:54:36,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:36,633 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] [2020-07-19 23:54:36,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:54:36,846 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-19 23:54:36,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:36,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252300195] [2020-07-19 23:54:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-07-19 23:54:37,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252300195] [2020-07-19 23:54:37,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608989455] [2020-07-19 23:54:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2264f963 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-19 23:54:37,382 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2264f963 issued 2 check-sat command(s) [2020-07-19 23:54:37,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:54:37,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 23:54:37,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:54:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-19 23:54:37,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:54:37,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-19 23:54:37,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840619600] [2020-07-19 23:54:37,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:54:37,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:54:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:54:37,465 INFO L87 Difference]: Start difference. First operand 1456 states and 1754 transitions. Second operand 3 states. [2020-07-19 23:54:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:37,666 INFO L93 Difference]: Finished difference Result 2885 states and 3538 transitions. [2020-07-19 23:54:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:54:37,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-19 23:54:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:37,679 INFO L225 Difference]: With dead ends: 2885 [2020-07-19 23:54:37,679 INFO L226 Difference]: Without dead ends: 1450 [2020-07-19 23:54:37,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:54:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-07-19 23:54:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-07-19 23:54:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-07-19 23:54:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1726 transitions. [2020-07-19 23:54:37,843 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1726 transitions. Word has length 174 [2020-07-19 23:54:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:37,844 INFO L479 AbstractCegarLoop]: Abstraction has 1450 states and 1726 transitions. [2020-07-19 23:54:37,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:54:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1726 transitions. [2020-07-19 23:54:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-19 23:54:37,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:37,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-19 23:54:38,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-19 23:54:38,066 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-19 23:54:38,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:38,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825323987] [2020-07-19 23:54:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:38,348 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-19 23:54:38,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825323987] [2020-07-19 23:54:38,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729162466] [2020-07-19 23:54:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@21f310b2 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-19 23:54:38,446 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@21f310b2 issued 1 check-sat command(s) [2020-07-19 23:54:38,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:54:38,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 23:54:38,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:54:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-19 23:54:38,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:54:38,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-19 23:54:38,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628324699] [2020-07-19 23:54:38,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:54:38,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:38,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:54:38,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:38,489 INFO L87 Difference]: Start difference. First operand 1450 states and 1726 transitions. Second operand 3 states. [2020-07-19 23:54:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:38,693 INFO L93 Difference]: Finished difference Result 3356 states and 4007 transitions. [2020-07-19 23:54:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:54:38,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-19 23:54:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:38,704 INFO L225 Difference]: With dead ends: 3356 [2020-07-19 23:54:38,704 INFO L226 Difference]: Without dead ends: 954 [2020-07-19 23:54:38,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2020-07-19 23:54:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 952. [2020-07-19 23:54:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-07-19 23:54:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1084 transitions. [2020-07-19 23:54:38,823 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1084 transitions. Word has length 175 [2020-07-19 23:54:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:38,823 INFO L479 AbstractCegarLoop]: Abstraction has 952 states and 1084 transitions. [2020-07-19 23:54:38,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:54:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1084 transitions. [2020-07-19 23:54:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-19 23:54:38,827 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:38,828 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] [2020-07-19 23:54:39,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:54:39,041 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-19 23:54:39,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:39,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139516305] [2020-07-19 23:54:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-07-19 23:54:39,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139516305] [2020-07-19 23:54:39,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45688799] [2020-07-19 23:54:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cd1b452 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-19 23:54:39,514 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cd1b452 issued 4 check-sat command(s) [2020-07-19 23:54:39,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:54:39,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 23:54:39,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:54:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-19 23:54:39,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:54:39,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-19 23:54:39,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547266173] [2020-07-19 23:54:39,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:54:39,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:54:39,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:39,567 INFO L87 Difference]: Start difference. First operand 952 states and 1084 transitions. Second operand 3 states. [2020-07-19 23:54:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:39,748 INFO L93 Difference]: Finished difference Result 1701 states and 1978 transitions. [2020-07-19 23:54:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:54:39,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-19 23:54:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:39,757 INFO L225 Difference]: With dead ends: 1701 [2020-07-19 23:54:39,757 INFO L226 Difference]: Without dead ends: 952 [2020-07-19 23:54:39,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:54:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2020-07-19 23:54:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2020-07-19 23:54:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-07-19 23:54:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1076 transitions. [2020-07-19 23:54:39,863 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1076 transitions. Word has length 175 [2020-07-19 23:54:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:39,866 INFO L479 AbstractCegarLoop]: Abstraction has 952 states and 1076 transitions. [2020-07-19 23:54:39,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:54:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1076 transitions. [2020-07-19 23:54:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-19 23:54:39,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:54:39,871 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-19 23:54:40,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-19 23:54:40,088 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:54:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:54:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-19 23:54:40,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:54:40,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683712919] [2020-07-19 23:54:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@11d8928f [2020-07-19 23:54:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:54:40,523 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-19 23:54:40,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683712919] [2020-07-19 23:54:40,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080556885] [2020-07-19 23:54:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@23cd69fa 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-19 23:54:40,701 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@23cd69fa issued 4 check-sat command(s) [2020-07-19 23:54:40,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:54:40,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-19 23:54:40,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:54:40,867 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-19 23:54:40,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:54:40,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-19 23:54:40,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726237683] [2020-07-19 23:54:40,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 23:54:40,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:54:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 23:54:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-19 23:54:40,873 INFO L87 Difference]: Start difference. First operand 952 states and 1076 transitions. Second operand 12 states. [2020-07-19 23:54:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:54:43,735 INFO L93 Difference]: Finished difference Result 1204 states and 1390 transitions. [2020-07-19 23:54:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-19 23:54:43,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2020-07-19 23:54:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:54:43,738 INFO L225 Difference]: With dead ends: 1204 [2020-07-19 23:54:43,738 INFO L226 Difference]: Without dead ends: 0 [2020-07-19 23:54:43,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-19 23:54:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-19 23:54:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-19 23:54:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-19 23:54:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-19 23:54:43,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-19 23:54:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:54:43,744 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-19 23:54:43,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 23:54:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-19 23:54:43,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-19 23:54:43,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:54:43,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-19 23:54:44,755 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-19 23:54:44,894 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-19 23:54:45,067 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-19 23:54:45,184 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-19 23:54:45,303 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-19 23:54:56,374 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-19 23:54:57,252 WARN L193 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-07-19 23:54:57,623 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-07-19 23:54:58,128 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:54:58,653 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:54:58,802 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-07-19 23:54:59,306 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:54:59,854 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:55:00,476 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:55:01,244 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 81 [2020-07-19 23:55:01,941 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-07-19 23:55:02,880 WARN L193 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 65 [2020-07-19 23:55:03,272 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-07-19 23:55:03,908 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 55 [2020-07-19 23:55:04,852 WARN L193 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 78 [2020-07-19 23:55:05,500 WARN L193 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-19 23:55:06,011 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:55:07,577 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 166 DAG size of output: 96 [2020-07-19 23:55:07,854 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-07-19 23:55:08,289 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 51 [2020-07-19 23:55:08,504 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-07-19 23:55:10,101 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 166 DAG size of output: 96 [2020-07-19 23:55:10,446 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-07-19 23:55:10,961 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:55:12,517 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 166 DAG size of output: 96 [2020-07-19 23:55:12,724 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-19 23:55:13,006 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-19 23:55:13,687 WARN L193 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-19 23:55:14,027 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-07-19 23:55:14,362 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2020-07-19 23:55:14,663 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-07-19 23:55:15,540 WARN L193 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2020-07-19 23:55:15,867 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-07-19 23:55:16,484 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-07-19 23:55:17,237 WARN L193 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 67 [2020-07-19 23:55:17,754 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-19 23:55:18,650 WARN L193 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 55 [2020-07-19 23:55:19,148 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-07-19 23:55:19,550 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-07-19 23:55:19,930 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2020-07-19 23:55:20,036 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-07-19 23:55:20,297 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-19 23:55:20,404 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-19 23:55:20,788 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-07-19 23:55:20,884 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-19 23:55:20,884 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 .cse1 .cse0 .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-19 23:55:20,884 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-19 23:55:20,884 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse1 (<= 2 ~T1_E~0)) (.cse0 (<= 2 ~E_1~0)) (.cse18 (= 1 ~m_pc~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (<= 2 ~E_M~0))) (let ((.cse17 (and (not .cse18) .cse14 .cse15 .cse4)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not .cse0)) (.cse6 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse13 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse9 (not .cse1)) (.cse11 (not (<= |old(~token~0)| ~local~0)))) (and (let ((.cse3 (not .cse8))) (or (let ((.cse2 (+ ~local~0 1))) (and (= 0 ~m_st~0) .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) (= 1 ~t1_pc~0) .cse3 .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse3 .cse4 (<= 2 ~m_st~0)) .cse10 (not (= 1 |old(~t1_pc~0)|)) .cse11)) (or .cse5 .cse6 .cse12 (and .cse13 .cse14 .cse15 .cse16 (= |old(~token~0)| ~token~0)) .cse17 .cse8 .cse9 .cse10) (or .cse5 .cse6 .cse17 .cse8 .cse9 .cse18 .cse10) (or .cse5 .cse6 .cse12 (not (= 0 |old(~m_st~0)|)) (and .cse13 .cse14 .cse15 (<= ~token~0 ~local~0) .cse16 (<= ~local~0 ~token~0)) .cse7 .cse8 .cse9 .cse18 .cse11)))) [2020-07-19 23:55:20,885 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-19 23:55:20,885 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-19 23:55:20,885 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-19 23:55:20,885 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-19 23:55:20,886 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-19 23:55:20,886 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse10 (= 1 ~m_pc~0)) (.cse16 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0))) (let ((.cse5 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (not .cse17)) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (not (<= 2 ~T1_E~0))) (.cse12 (= 0 ~m_st~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (and .cse17 (not .cse10) .cse16 .cse3)) (.cse14 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse4 .cse6 .cse7 .cse10 .cse8 .cse9) (or .cse0 .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse11 .cse6 .cse7 (and .cse12 (<= ~token~0 ~local~0) .cse13 .cse1 .cse2 (<= ~local~0 ~token~0)) .cse10 .cse14) (or .cse0 .cse4 .cse11 .cse6 .cse7 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse16 .cse1)) .cse8 (and .cse16 .cse1 .cse3) .cse9 (not (= 1 |old(~t1_pc~0)|)) .cse14)))) [2020-07-19 23:55:20,886 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-19 23:55:20,887 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-19 23:55:20,887 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-19 23:55:20,887 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-19 23:55:20,887 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-19 23:55:20,887 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-19 23:55:20,887 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 .cse0 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse1 .cse0 .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-19 23:55:20,888 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse18 (<= 2 ~T1_E~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (+ ~local~0 1)) (.cse15 (<= 2 ~E_1~0))) (let ((.cse3 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse15)) (.cse2 (not (= 1 ~t1_pc~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse21 ~token~0))) (.cse14 (not (<= ~token~0 .cse21))) (.cse1 (and .cse16 .cse17)) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not .cse18)) (.cse9 (not (<= ~t1_pc~0 0))) (.cse20 (= 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 .cse0 .cse1 .cse4 .cse10 .cse5 .cse6 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse8) (let ((.cse12 (let ((.cse19 (not .cse5))) (or (and .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse15 (= 1 ~E_M~0) .cse18 .cse19))))) (or .cse0 .cse2 (and (= 0 ~m_st~0) .cse12) (and .cse12 (<= 2 ~m_st~0)) .cse5 .cse6 .cse13 .cse7 .cse14)) (or .cse1 .cse0 .cse5 .cse6 .cse20 .cse7) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse4 .cse10 .cse5 .cse6 .cse13 .cse14) (or .cse1 .cse4 .cse5 .cse6 .cse9 .cse20 .cse11)))) [2020-07-19 23:55:20,888 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-19 23:55:20,888 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 .cse0 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse1 .cse0 .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-19 23:55:20,888 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-19 23:55:20,888 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-19 23:55:20,888 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-19 23:55:20,888 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-19 23:55:20,889 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-19 23:55:20,889 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-19 23:55:20,889 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-19 23:55:20,889 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-19 23:55:20,889 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-19 23:55:20,889 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-19 23:55:20,889 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse4 (not (<= 2 ~E_M~0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse7 (not (= 0 ~m_st~0))) (.cse1 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 (not (<= 2 ~m_st~0)) .cse2 .cse3) (or .cse4 .cse1 .cse2 .cse3 (not (<= ~t1_pc~0 0)) .cse5 (= 0 ~E_1~0)) (or .cse0 .cse6 .cse7 (not (<= ~token~0 ~local~0)) .cse4 (not (<= 2 ~t1_st~0)) .cse1 .cse2 .cse3 .cse5 (not (<= ~local~0 ~token~0))) (let ((.cse8 (+ ~local~0 1))) (or .cse0 .cse6 .cse7 .cse1 .cse2 .cse3 (not (<= .cse8 ~token~0)) (not (<= ~token~0 .cse8)))))) [2020-07-19 23:55:20,889 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-19 23:55:20,889 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-19 23:55:20,890 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-19 23:55:20,890 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-19 23:55:20,890 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-19 23:55:20,890 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-19 23:55:20,890 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 .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-19 23:55:20,890 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-19 23:55:20,890 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-19 23:55:20,891 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-19 23:55:20,891 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-19 23:55:20,891 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-19 23:55:20,891 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-19 23:55:20,891 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-19 23:55:20,891 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-19 23:55:20,891 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-19 23:55:20,891 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-19 23:55:20,892 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-19 23:55:20,892 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-19 23:55:20,892 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-19 23:55:20,892 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-19 23:55:20,892 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-19 23:55:20,892 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-19 23:55:20,892 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-19 23:55:20,893 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-19 23:55:20,893 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse10 (+ |old(~local~0)| 1))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse8 (not (<= |old(~token~0)| .cse10))) (.cse2 (not (<= 2 |old(~t1_st~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))) (.cse9 (not (<= .cse10 |old(~token~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (or .cse1 .cse3 .cse4 .cse5 .cse6 (not (<= ~t1_pc~0 0))) (or (let ((.cse7 (+ ~local~0 1))) (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)|) (<= ~token~0 .cse7) (= ~local~0 |old(~local~0)|) (<= .cse7 ~token~0))) .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9)))) [2020-07-19 23:55:20,893 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_1~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (and .cse12 .cse9 .cse14 .cse13)) (.cse8 (and .cse12 (<= ~token~0 ~local~0) .cse14 (<= ~local~0 ~token~0) .cse13)) (.cse1 (not .cse14)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse11)) .cse2 .cse3 .cse4 .cse6 .cse7 (not (<= .cse11 |old(~token~0)|)) .cse8)) (or (and .cse12 .cse13) .cse1 .cse3 .cse4 .cse5 .cse6 .cse10)))) [2020-07-19 23:55:20,893 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-19 23:55:20,894 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~local~0 |old(~local~0)|))) (let ((.cse3 (and .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~token~0)| ~token~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 ~M_E~0)) (.cse4 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0))) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse6 .cse0 (not (<= |old(~token~0)| .cse7)) .cse8 .cse1 .cse2 .cse3 .cse5 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse0 .cse8 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 (and .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))))) [2020-07-19 23:55:20,894 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse17 (+ |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)) (.cse16 (<= 2 ~E_M~0)) (.cse8 (<= ~local~0 ~token~0))) (let ((.cse13 (and .cse15 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t1_st~0) .cse16 .cse8)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= |old(~token~0)| .cse17))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= .cse17 |old(~token~0)|))) (.cse1 (not .cse16)) (.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-19 23:55:20,894 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-19 23:55:20,894 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse11 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~m_pc~0)|)) (.cse9 (not (<= 2 ~T1_E~0))) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~local~0 |old(~local~0)|))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~token~0)| ~token~0)) .cse8 .cse9 (not (<= ~t1_pc~0 0))) (let ((.cse12 (+ |old(~local~0)| 1))) (or (let ((.cse10 (+ ~local~0 1))) (and .cse3 .cse4 .cse5 .cse6 (<= ~token~0 .cse10) .cse7 (<= .cse10 ~token~0))) .cse11 .cse0 (not (<= |old(~token~0)| .cse12)) .cse13 .cse1 .cse2 .cse9 (not (<= .cse12 |old(~token~0)|)))) (or .cse11 .cse0 .cse13 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse8 (not (<= |old(~local~0)| |old(~token~0)|)) .cse9 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0))))) [2020-07-19 23:55:20,895 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-19 23:55:20,895 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-19 23:55:20,895 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~m_st~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (not (= 0 ~m_st~0))) (.cse9 (not (<= ~token~0 ~local~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (= 1 ~m_pc~0)) (.cse10 (not (<= ~local~0 ~token~0))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse6) (or .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6) (or .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse6) (or .cse0 .cse8 .cse12 .cse9 .cse1 .cse2 .cse11 .cse4 .cse7 .cse10 .cse6) (or .cse0 .cse12 .cse1 .cse11 .cse2 .cse4 .cse5 .cse7 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse8 .cse12 .cse1 .cse11 .cse2 .cse4 (not (<= .cse13 ~token~0)) (not (<= ~token~0 .cse13)) .cse6)) (or .cse0 .cse12 .cse9 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse6))) [2020-07-19 23:55:20,895 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-19 23:55:20,895 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-19 23:55:20,895 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-19 23:55:20,895 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-19 23:55:20,896 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~local~0 |old(~local~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (<= ~local~0 ~token~0))) (let ((.cse10 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22)) (.cse11 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 (= |old(~token~0)| ~token~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse8 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse13 (not (= 1 |old(~t1_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5) (or .cse0 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse6 .cse13) (or .cse0 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse2 .cse11 .cse3 .cse9 .cse12 .cse4) (or .cse0 .cse8 .cse1 .cse10 .cse2 .cse11 .cse3 .cse9 .cse12 .cse4 .cse13) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse23)) .cse1 .cse2 .cse3 .cse4 (let ((.cse24 (+ ~local~0 1))) (and .cse15 .cse16 .cse17 .cse18 (<= ~token~0 .cse24) .cse19 (<= .cse24 ~token~0) .cse25 .cse21)) (not (<= .cse23 |old(~token~0)|)) .cse13))))) [2020-07-19 23:55:20,896 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-19 23:55:20,896 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-19 23:55:20,896 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-19 23:55:20,896 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-19 23:55:20,897 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse4 (= 0 ~M_E~0))) (let ((.cse34 (not (= 1 ~m_pc~0))) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse29 (not .cse4)) (.cse30 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~m_st~0))) (let ((.cse15 (not (= 1 |old(~t1_pc~0)|))) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse31)) (.cse10 (let ((.cse36 (+ ~local~0 1))) (and .cse32 .cse27 .cse28 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse29 .cse21 .cse30 .cse33))) (.cse11 (and .cse27 .cse28 .cse20 .cse29 .cse21 .cse30 .cse23 .cse31)) (.cse24 (= |old(~token~0)| ~token~0)) (.cse35 (and .cse27 .cse28 .cse19 .cse29 .cse30 .cse33 .cse22 .cse31)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse28)) (.cse6 (and .cse27 .cse34 .cse28 .cse29 .cse30 .cse31)) (.cse8 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse12 .cse4 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse15) (or .cse2 .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse4 .cse3 .cse9 .cse6 .cse15) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse14 .cse10 .cse0 .cse11 .cse25 (not (<= |old(~token~0)| .cse26)) .cse4 .cse3 .cse6 (not (<= .cse26 |old(~token~0)|)) .cse15)) (or (and .cse27 .cse28 .cse29 .cse30 .cse8 .cse31) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 .cse1 .cse25 .cse4 .cse3 .cse9 .cse6 (and .cse32 .cse27 .cse28 .cse30 .cse33 .cse24 .cse34 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23)) (or (and .cse19 .cse22 .cse8 .cse31) .cse0 .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or (and .cse32 .cse34 .cse19 .cse33 .cse22 .cse8) .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse8 .cse31)))))) [2020-07-19 23:55:20,897 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse18 (= 0 ~M_E~0))) (let ((.cse0 (not (= 1 ~m_pc~0))) (.cse6 (<= 2 ~E_1~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse7 (not .cse18)) (.cse8 (<= 2 ~E_M~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse9 (<= 2 ~m_st~0))) (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (<= ~t1_pc~0 0)) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse17 (and .cse6 .cse2 (= 1 ~t1_pc~0) .cse7 .cse8 .cse4 .cse9)) (.cse11 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse22 (not (= 1 |old(~t1_pc~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse14 (not (<= 2 |old(~E_M~0)|))) (.cse10 (and .cse6 .cse0 .cse7 .cse8 .cse9)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse19 (not (<= 2 |old(~E_1~0)|))) (.cse13 (not (<= 2 ~T1_E~0))) (.cse21 (not (<= 2 |old(~m_st~0)|)))) (and (or (and (= 0 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~token~0)| ~token~0)) (and .cse6 .cse7 .cse8 .cse5 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse14 .cse10 .cse17 .cse19 .cse11 .cse18 .cse12 .cse13 .cse21 .cse22) (or .cse14 .cse15 .cse16 .cse10 .cse23 .cse19 .cse18 .cse20 .cse13) (let ((.cse24 (+ |old(~local~0)| 1))) (or .cse14 .cse16 .cse10 .cse17 (not (<= |old(~token~0)| .cse24)) .cse23 .cse19 .cse18 .cse13 (not (<= .cse24 |old(~token~0)|)) .cse22)) (or (and .cse1 .cse3 .cse5 .cse9) .cse14 .cse15 .cse10 .cse19 .cse18 .cse13 .cse21) (or .cse14 .cse16 .cse10 .cse17 .cse23 .cse19 .cse11 .cse18 .cse20 .cse12 .cse13 .cse22) (or .cse14 .cse10 .cse19 .cse18 .cse20 .cse13 .cse21) (or .cse14 .cse10 .cse23 .cse19 .cse18 .cse13 .cse21))))) [2020-07-19 23:55:20,898 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse4 (= 0 ~M_E~0))) (let ((.cse34 (not (= 1 ~m_pc~0))) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse29 (not .cse4)) (.cse30 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~m_st~0))) (let ((.cse15 (not (= 1 |old(~t1_pc~0)|))) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse31)) (.cse10 (let ((.cse36 (+ ~local~0 1))) (and .cse32 .cse27 .cse28 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse29 .cse21 .cse30 .cse33))) (.cse11 (and .cse27 .cse28 .cse20 .cse29 .cse21 .cse30 .cse23 .cse31)) (.cse24 (= |old(~token~0)| ~token~0)) (.cse35 (and .cse27 .cse28 .cse19 .cse29 .cse30 .cse33 .cse22 .cse31)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse28)) (.cse6 (and .cse27 .cse34 .cse28 .cse29 .cse30 .cse31)) (.cse8 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse12 .cse4 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse15) (or .cse2 .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse4 .cse3 .cse9 .cse6 .cse15) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse14 .cse10 .cse0 .cse11 .cse25 (not (<= |old(~token~0)| .cse26)) .cse4 .cse3 .cse6 (not (<= .cse26 |old(~token~0)|)) .cse15)) (or (and .cse27 .cse28 .cse29 .cse30 .cse8 .cse31) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 .cse1 .cse25 .cse4 .cse3 .cse9 .cse6 (and .cse32 .cse27 .cse28 .cse30 .cse33 .cse24 .cse34 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23)) (or (and .cse19 .cse22 .cse8 .cse31) .cse0 .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or (and .cse32 .cse34 .cse19 .cse33 .cse22 .cse8) .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse8 .cse31)))))) [2020-07-19 23:55:20,898 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-19 23:55:20,898 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse3 (= 0 ~M_E~0))) (let ((.cse13 (<= 2 ~E_1~0)) (.cse22 (= 1 ~t1_pc~0)) (.cse16 (not .cse3)) (.cse18 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~E_M~0)) (.cse15 (<= 2 ~T1_E~0))) (let ((.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (= 1 |old(~m_pc~0)|)) (.cse7 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not .cse15)) (.cse8 (let ((.cse27 (+ ~local~0 1))) (and .cse13 .cse15 (<= ~token~0 .cse27) (<= .cse27 ~token~0) .cse22 .cse16 .cse18 .cse17))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse14 (not (= 1 ~m_pc~0))) (.cse20 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (<= ~token~0 ~local~0)) (.cse23 (= ~E_M~0 |old(~E_M~0)|)) (.cse24 (<= ~local~0 ~token~0)) (.cse25 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse2 .cse6 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9) (or .cse0 .cse2 .cse3 .cse10 .cse4 .cse5) (or .cse0 .cse11 .cse12 .cse1 .cse2 .cse3 .cse10 .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse11 .cse12 .cse2 .cse6 .cse3 .cse10 .cse7 .cse4 .cse8 (and .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse22 .cse17 .cse18 .cse23 .cse24 .cse25) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse19)) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse0 .cse12 (not (<= |old(~token~0)| .cse26)) .cse1 .cse2 .cse3 .cse4 .cse8 (not (<= .cse26 |old(~token~0)|)) .cse9)) (or .cse0 .cse12 .cse1 .cse2 .cse6 .cse3 .cse10 .cse7 .cse4 .cse8 .cse9 (and .cse14 .cse20 .cse21 .cse22 .cse18 .cse23 .cse24 .cse25)))))) [2020-07-19 23:55:20,898 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-19 23:55:20,899 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse4 (= 0 ~M_E~0))) (let ((.cse34 (not (= 1 ~m_pc~0))) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse29 (not .cse4)) (.cse30 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~m_st~0))) (let ((.cse15 (not (= 1 |old(~t1_pc~0)|))) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse31)) (.cse10 (let ((.cse36 (+ ~local~0 1))) (and .cse32 .cse27 .cse28 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse29 .cse21 .cse30 .cse33))) (.cse11 (and .cse27 .cse28 .cse20 .cse29 .cse21 .cse30 .cse23 .cse31)) (.cse24 (= |old(~token~0)| ~token~0)) (.cse35 (and .cse27 .cse28 .cse19 .cse29 .cse30 .cse33 .cse22 .cse31)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse28)) (.cse6 (and .cse27 .cse34 .cse28 .cse29 .cse30 .cse31)) (.cse8 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse12 .cse4 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse15) (or .cse2 .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse4 .cse3 .cse9 .cse6 .cse15) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse14 .cse10 .cse0 .cse11 .cse25 (not (<= |old(~token~0)| .cse26)) .cse4 .cse3 .cse6 (not (<= .cse26 |old(~token~0)|)) .cse15)) (or (and .cse27 .cse28 .cse29 .cse30 .cse8 .cse31) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 .cse1 .cse25 .cse4 .cse3 .cse9 .cse6 (and .cse32 .cse27 .cse28 .cse30 .cse33 .cse24 .cse34 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23)) (or (and .cse19 .cse22 .cse8 .cse31) .cse0 .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or (and .cse32 .cse34 .cse19 .cse33 .cse22 .cse8) .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse8 .cse31)))))) [2020-07-19 23:55:20,899 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-19 23:55:20,899 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-19 23:55:20,899 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-19 23:55:20,899 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-19 23:55:20,899 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-19 23:55:20,899 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-19 23:55:20,900 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-19 23:55:20,900 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-19 23:55:20,900 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-19 23:55:20,900 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-19 23:55:20,900 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 .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-19 23:55:20,900 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-19 23:55:20,900 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-19 23:55:20,901 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-19 23:55:20,901 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-19 23:55:20,901 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-19 23:55:20,901 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-19 23:55:20,901 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (<= ~t1_pc~0 0))) (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t1_st~0) .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 23:55:20,901 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-19 23:55:20,901 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-19 23:55:20,902 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-19 23:55:20,902 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse12 (= |old(~token~0)| ~token~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse13 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse11 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse4 .cse6 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse8 .cse2 .cse4 .cse6 .cse13) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse10 .cse13) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse1 .cse2 .cse4 .cse6 .cse11 .cse13) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse11))) [2020-07-19 23:55:20,902 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,902 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,903 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,903 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,903 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,903 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-19 23:55:20,904 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,904 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-19 23:55:20,904 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,904 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-19 23:55:20,905 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (<= ~t1_pc~0 0))) (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t1_st~0) .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 23:55:20,905 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (<= ~t1_pc~0 0))) (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t1_st~0) .cse5 .cse6) (and .cse1 .cse3 .cse2 .cse4 .cse5 (<= 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 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 23:55:20,905 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,905 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-19 23:55:20,906 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,906 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-19 23:55:20,906 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-19 23:55:20,906 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-19 23:55:20,906 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-19 23:55:20,906 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-19 23:55:20,907 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))) (.cse8 (not (<= .cse15 ~token~0))) (.cse9 (not (<= ~token~0 .cse15))) (.cse0 (not (<= 2 ~E_1~0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse11 (= 1 ~m_pc~0)) (.cse7 (not (= 1 ~t1_pc~0))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 ~t1_st~0))) (.cse4 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse12 (= 0 ~E_1~0)) (.cse6 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 (not (= 0 ~m_st~0)) .cse1 .cse2 .cse4 .cse5 .cse8 .cse6 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse10 .cse6) (or .cse1 .cse4 .cse5 .cse10 .cse11 .cse12 .cse6) (or .cse0 .cse7 (= 1 ~E_M~0) .cse3 .cse4 .cse5 .cse8 .cse6 .cse9) (or .cse0 .cse7 .cse13 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6) (or .cse0 .cse3 .cse4 .cse5 .cse11 .cse6) (or .cse7 .cse13 .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse14)))) [2020-07-19 23:55:20,907 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-19 23:55:20,907 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-19 23:55:20,907 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-19 23:55:20,907 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-19 23:55:20,907 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-19 23:55:20,907 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-19 23:55:20,908 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-19 23:55:20,908 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-19 23:55:20,908 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-19 23:55:20,908 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-19 23:55:20,908 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-19 23:55:20,908 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-19 23:55:20,908 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 .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-19 23:55:20,909 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-19 23:55:20,909 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-19 23:55:20,909 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-19 23:55:20,909 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-19 23:55:20,909 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-19 23:55:20,909 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-19 23:55:20,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:55:20 BoogieIcfgContainer [2020-07-19 23:55:20,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 23:55:20,977 INFO L168 Benchmark]: Toolchain (without parser) took 61907.06 ms. Allocated memory was 136.8 MB in the beginning and 897.6 MB in the end (delta: 760.7 MB). Free memory was 99.8 MB in the beginning and 362.7 MB in the end (delta: -262.9 MB). Peak memory consumption was 790.7 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:20,978 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-19 23:55:20,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.21 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 179.4 MB in the end (delta: -80.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:20,979 INFO L168 Benchmark]: Boogie Preprocessor took 51.13 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 177.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:20,980 INFO L168 Benchmark]: RCFGBuilder took 655.94 ms. Allocated memory is still 201.3 MB. Free memory was 177.2 MB in the beginning and 146.2 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:20,981 INFO L168 Benchmark]: TraceAbstraction took 60742.09 ms. Allocated memory was 201.3 MB in the beginning and 897.6 MB in the end (delta: 696.3 MB). Free memory was 145.5 MB in the beginning and 362.7 MB in the end (delta: -217.2 MB). Peak memory consumption was 771.9 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:20,983 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 450.21 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 179.4 MB in the end (delta: -80.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.13 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 177.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 655.94 ms. Allocated memory is still 201.3 MB. Free memory was 177.2 MB in the beginning and 146.2 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60742.09 ms. Allocated memory was 201.3 MB in the beginning and 897.6 MB in the end (delta: 696.3 MB). Free memory was 145.5 MB in the beginning and 362.7 MB in the end (delta: -217.2 MB). Peak memory consumption was 771.9 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)) || !(\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(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)))) && (((((((((((((((((((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 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 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)) || ((((((((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 <= \old(t1_st)) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 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)) || !(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)) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || ((((((((\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 && 2 <= T1_E) && !(0 == M_E)) && 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(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))) && (((((((((((E_1 == \old(E_1) && E_M == \old(E_M)) && t1_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 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)))) && (((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 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)))) && (((((((((((((((0 == m_st && !(1 == m_pc)) && E_1 == \old(E_1)) && 2 <= t1_st) && E_M == \old(E_M)) && t1_pc <= 0) || !(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 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && t1_pc <= 0) && 2 <= m_st)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) && (((((((((!(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_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))) && (((((!(2 <= E_1) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || (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)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((!(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_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st)) && (((((((!(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)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || ((((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: ((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && !(0 == M_E)) && 2 <= E_M) || !(2 <= E_1)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(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)) || !(\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(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)))) && (((((((((((((((((((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 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 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)) || ((((((((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 <= \old(t1_st)) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 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)) || !(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)) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || ((((((((\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 && 2 <= T1_E) && !(0 == M_E)) && 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(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))) && (((((((((((E_1 == \old(E_1) && E_M == \old(E_M)) && t1_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 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)))) && (((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 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)))) && (((((((((((((((0 == m_st && !(1 == m_pc)) && E_1 == \old(E_1)) && 2 <= t1_st) && E_M == \old(E_M)) && t1_pc <= 0) || !(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 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && t1_pc <= 0) && 2 <= m_st)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || ((2 <= t1_st && E_M == \old(E_M)) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) && ((((((!(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))) || !(\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))) || !(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_M && 2 <= t1_st) && 2 <= m_st)) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) - 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: (((((((((((((((((((((((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) || (((((2 <= E_1 && \old(T1_E) == T1_E) && !(0 == M_E)) && 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)) && 2 <= E_M) && local <= token) && t1_pc <= 0) && \old(token) == token)) || !(\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))) || ((((((((((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))) || (((((((2 <= E_1 && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || (((((2 <= E_1 && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E))) || (((((((0 == m_st && 2 <= E_1) && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && t1_pc <= 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(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))) && ((((((((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local + 1) && local == \old(local)) && local + 1 <= token) || !(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)))) && ((((((((!(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) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) && ((((((!(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) || !(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)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(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)) || !(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)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && token <= local) && local <= token)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2265 SDtfs, 4749 SDslu, 1153 SDs, 0 SdLazy, 7856 SolverSat, 2490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1573 GetRequests, 1391 SyntacticMatches, 4 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1456occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 985 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3447 PreInvPairs, 4665 NumberOfFragments, 12964 HoareAnnotationTreeSize, 3447 FomulaSimplifications, 26849855 FormulaSimplificationTreeSizeReduction, 12.1s HoareSimplificationTime, 62 FomulaSimplificationsInter, 424619 FormulaSimplificationTreeSizeReductionInter, 24.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2493 NumberOfCodeBlocks, 2147 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2474 ConstructedInterpolants, 0 QuantifiedInterpolants, 760279 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2646 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 979/1054 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...