./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2216fd6115b2bb44c4633e353be739828d7cac46 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:01,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:01,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:01,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:01,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:01,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:01,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:01,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:01,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:01,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:01,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:01,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:01,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:01,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:01,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:01,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:01,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:01,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:01,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:01,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:01,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:01,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:01,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:01,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:01,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:01,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:01,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:01,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:01,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:01,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:01,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:01,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:01,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:01,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:01,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:01,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:01,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:01,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:01,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:01,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:01,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:01,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:01,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:01,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:01,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:01,347 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:01,348 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:01,348 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:01,348 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:01,348 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:01,349 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:01,349 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:01,349 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:01,349 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:01,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:01,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:01,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:01,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:01,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:01,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:01,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:01,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:01,352 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:01,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:01,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:01,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:01,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:01,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:01,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:01,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:01,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:01,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:01,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:01,354 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:01,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:01,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:01,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:01,355 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2216fd6115b2bb44c4633e353be739828d7cac46 [2019-10-22 11:25:01,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:01,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:01,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:01,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:01,422 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:01,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-10-22 11:25:01,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/data/4f55fe91a/ff5e990b2fc844b6bc4abeaae8be13d6/FLAG6398a41d2 [2019-10-22 11:25:01,903 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:01,904 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-10-22 11:25:01,912 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/data/4f55fe91a/ff5e990b2fc844b6bc4abeaae8be13d6/FLAG6398a41d2 [2019-10-22 11:25:01,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/data/4f55fe91a/ff5e990b2fc844b6bc4abeaae8be13d6 [2019-10-22 11:25:01,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:01,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:01,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:01,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:01,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:01,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6ea6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01, skipping insertion in model container [2019-10-22 11:25:01,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,943 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:01,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:02,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:02,253 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:02,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:02,307 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:02,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02 WrapperNode [2019-10-22 11:25:02,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:02,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:02,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:02,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:02,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:02,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:02,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:02,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:02,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:02,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:02,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:02,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:02,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:02,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:03,326 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:03,326 INFO L284 CfgBuilder]: Removed 80 assume(true) statements. [2019-10-22 11:25:03,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:03 BoogieIcfgContainer [2019-10-22 11:25:03,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:03,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:03,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:03,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:03,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:01" (1/3) ... [2019-10-22 11:25:03,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f24e7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:03, skipping insertion in model container [2019-10-22 11:25:03,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (2/3) ... [2019-10-22 11:25:03,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f24e7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:03, skipping insertion in model container [2019-10-22 11:25:03,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:03" (3/3) ... [2019-10-22 11:25:03,336 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-10-22 11:25:03,347 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:03,354 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:25:03,362 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:25:03,386 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:03,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:03,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:03,387 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:03,387 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:03,387 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:03,387 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:03,387 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-10-22 11:25:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:25:03,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,416 INFO L380 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] [2019-10-22 11:25:03,418 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-10-22 11:25:03,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391904874] [2019-10-22 11:25:03,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391904874] [2019-10-22 11:25:03,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:03,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242986183] [2019-10-22 11:25:03,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:03,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:03,602 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-10-22 11:25:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,668 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2019-10-22 11:25:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:03,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:25:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,684 INFO L225 Difference]: With dead ends: 277 [2019-10-22 11:25:03,684 INFO L226 Difference]: Without dead ends: 137 [2019-10-22 11:25:03,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-22 11:25:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-10-22 11:25:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-22 11:25:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-10-22 11:25:03,740 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2019-10-22 11:25:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,741 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-10-22 11:25:03,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-10-22 11:25:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:25:03,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,743 INFO L380 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] [2019-10-22 11:25:03,743 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-10-22 11:25:03,744 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834720574] [2019-10-22 11:25:03,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834720574] [2019-10-22 11:25:03,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:03,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748604585] [2019-10-22 11:25:03,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:03,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:03,799 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2019-10-22 11:25:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,886 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2019-10-22 11:25:03,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:03,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:25:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,889 INFO L225 Difference]: With dead ends: 363 [2019-10-22 11:25:03,890 INFO L226 Difference]: Without dead ends: 232 [2019-10-22 11:25:03,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-22 11:25:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-10-22 11:25:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:25:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-10-22 11:25:03,939 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2019-10-22 11:25:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,940 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-10-22 11:25:03,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-10-22 11:25:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:25:03,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,941 INFO L380 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] [2019-10-22 11:25:03,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-10-22 11:25:03,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034225120] [2019-10-22 11:25:03,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034225120] [2019-10-22 11:25:03,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:03,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782479706] [2019-10-22 11:25:03,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:03,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:03,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:03,983 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-10-22 11:25:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,019 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2019-10-22 11:25:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:25:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,021 INFO L225 Difference]: With dead ends: 453 [2019-10-22 11:25:04,022 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 11:25:04,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 11:25:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-10-22 11:25:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:25:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2019-10-22 11:25:04,058 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2019-10-22 11:25:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,059 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2019-10-22 11:25:04,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2019-10-22 11:25:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:25:04,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,060 INFO L380 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] [2019-10-22 11:25:04,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-10-22 11:25:04,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898991172] [2019-10-22 11:25:04,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898991172] [2019-10-22 11:25:04,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:04,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702206518] [2019-10-22 11:25:04,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,117 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand 3 states. [2019-10-22 11:25:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,175 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2019-10-22 11:25:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:25:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,177 INFO L225 Difference]: With dead ends: 452 [2019-10-22 11:25:04,177 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 11:25:04,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 11:25:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-10-22 11:25:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:25:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2019-10-22 11:25:04,198 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2019-10-22 11:25:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,198 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2019-10-22 11:25:04,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2019-10-22 11:25:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:25:04,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,199 INFO L380 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] [2019-10-22 11:25:04,200 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-10-22 11:25:04,200 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178606838] [2019-10-22 11:25:04,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178606838] [2019-10-22 11:25:04,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:04,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807240382] [2019-10-22 11:25:04,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,251 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 3 states. [2019-10-22 11:25:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,305 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2019-10-22 11:25:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:25:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,309 INFO L225 Difference]: With dead ends: 451 [2019-10-22 11:25:04,309 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 11:25:04,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 11:25:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-10-22 11:25:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:25:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 305 transitions. [2019-10-22 11:25:04,343 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 305 transitions. Word has length 39 [2019-10-22 11:25:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,343 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 305 transitions. [2019-10-22 11:25:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2019-10-22 11:25:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:25:04,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,345 INFO L380 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] [2019-10-22 11:25:04,345 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-10-22 11:25:04,346 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374264117] [2019-10-22 11:25:04,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374264117] [2019-10-22 11:25:04,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:04,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604079526] [2019-10-22 11:25:04,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,441 INFO L87 Difference]: Start difference. First operand 230 states and 305 transitions. Second operand 3 states. [2019-10-22 11:25:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,514 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2019-10-22 11:25:04,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:25:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,517 INFO L225 Difference]: With dead ends: 638 [2019-10-22 11:25:04,518 INFO L226 Difference]: Without dead ends: 419 [2019-10-22 11:25:04,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-10-22 11:25:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2019-10-22 11:25:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-22 11:25:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 517 transitions. [2019-10-22 11:25:04,551 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 517 transitions. Word has length 39 [2019-10-22 11:25:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,552 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 517 transitions. [2019-10-22 11:25:04,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 517 transitions. [2019-10-22 11:25:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:25:04,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,554 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:04,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1499945056, now seen corresponding path program 1 times [2019-10-22 11:25:04,555 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696956372] [2019-10-22 11:25:04,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696956372] [2019-10-22 11:25:04,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:04,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139833113] [2019-10-22 11:25:04,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,645 INFO L87 Difference]: Start difference. First operand 395 states and 517 transitions. Second operand 3 states. [2019-10-22 11:25:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,724 INFO L93 Difference]: Finished difference Result 1095 states and 1440 transitions. [2019-10-22 11:25:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 11:25:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,729 INFO L225 Difference]: With dead ends: 1095 [2019-10-22 11:25:04,729 INFO L226 Difference]: Without dead ends: 717 [2019-10-22 11:25:04,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-22 11:25:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 687. [2019-10-22 11:25:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-10-22 11:25:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 897 transitions. [2019-10-22 11:25:04,772 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 897 transitions. Word has length 63 [2019-10-22 11:25:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,773 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 897 transitions. [2019-10-22 11:25:04,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 897 transitions. [2019-10-22 11:25:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:25:04,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,775 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:04,775 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1803857567, now seen corresponding path program 1 times [2019-10-22 11:25:04,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959148023] [2019-10-22 11:25:04,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959148023] [2019-10-22 11:25:04,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:04,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133364929] [2019-10-22 11:25:04,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,818 INFO L87 Difference]: Start difference. First operand 687 states and 897 transitions. Second operand 3 states. [2019-10-22 11:25:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,931 INFO L93 Difference]: Finished difference Result 1933 states and 2521 transitions. [2019-10-22 11:25:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 11:25:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,937 INFO L225 Difference]: With dead ends: 1933 [2019-10-22 11:25:04,938 INFO L226 Difference]: Without dead ends: 1271 [2019-10-22 11:25:04,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-10-22 11:25:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1257. [2019-10-22 11:25:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-10-22 11:25:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1607 transitions. [2019-10-22 11:25:05,032 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1607 transitions. Word has length 63 [2019-10-22 11:25:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,033 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 1607 transitions. [2019-10-22 11:25:05,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1607 transitions. [2019-10-22 11:25:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:25:05,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,034 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:05,034 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash -45669778, now seen corresponding path program 1 times [2019-10-22 11:25:05,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421634654] [2019-10-22 11:25:05,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421634654] [2019-10-22 11:25:05,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:05,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566934710] [2019-10-22 11:25:05,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:05,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:05,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,074 INFO L87 Difference]: Start difference. First operand 1257 states and 1607 transitions. Second operand 3 states. [2019-10-22 11:25:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,206 INFO L93 Difference]: Finished difference Result 3544 states and 4519 transitions. [2019-10-22 11:25:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:05,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-22 11:25:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,215 INFO L225 Difference]: With dead ends: 3544 [2019-10-22 11:25:05,216 INFO L226 Difference]: Without dead ends: 2312 [2019-10-22 11:25:05,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-10-22 11:25:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2019-10-22 11:25:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-22 11:25:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2876 transitions. [2019-10-22 11:25:05,321 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2876 transitions. Word has length 64 [2019-10-22 11:25:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2876 transitions. [2019-10-22 11:25:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2876 transitions. [2019-10-22 11:25:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-22 11:25:05,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,325 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:25:05,325 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 460727628, now seen corresponding path program 1 times [2019-10-22 11:25:05,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258720439] [2019-10-22 11:25:05,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 11:25:05,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258720439] [2019-10-22 11:25:05,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:05,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677751273] [2019-10-22 11:25:05,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:05,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,392 INFO L87 Difference]: Start difference. First operand 2312 states and 2876 transitions. Second operand 3 states. [2019-10-22 11:25:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,531 INFO L93 Difference]: Finished difference Result 4080 states and 5097 transitions. [2019-10-22 11:25:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:05,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-22 11:25:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,541 INFO L225 Difference]: With dead ends: 4080 [2019-10-22 11:25:05,541 INFO L226 Difference]: Without dead ends: 2324 [2019-10-22 11:25:05,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-10-22 11:25:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2264. [2019-10-22 11:25:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-10-22 11:25:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2740 transitions. [2019-10-22 11:25:05,645 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2740 transitions. Word has length 93 [2019-10-22 11:25:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,646 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2740 transitions. [2019-10-22 11:25:05,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2740 transitions. [2019-10-22 11:25:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:25:05,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,649 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-22 11:25:05,649 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -491999912, now seen corresponding path program 1 times [2019-10-22 11:25:05,650 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665984379] [2019-10-22 11:25:05,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 11:25:05,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665984379] [2019-10-22 11:25:05,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:05,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534985543] [2019-10-22 11:25:05,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:05,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:05,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,701 INFO L87 Difference]: Start difference. First operand 2264 states and 2740 transitions. Second operand 3 states. [2019-10-22 11:25:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,828 INFO L93 Difference]: Finished difference Result 4484 states and 5430 transitions. [2019-10-22 11:25:05,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:05,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-22 11:25:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,837 INFO L225 Difference]: With dead ends: 4484 [2019-10-22 11:25:05,838 INFO L226 Difference]: Without dead ends: 2266 [2019-10-22 11:25:05,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-10-22 11:25:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-10-22 11:25:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-10-22 11:25:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2700 transitions. [2019-10-22 11:25:05,955 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2700 transitions. Word has length 94 [2019-10-22 11:25:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,955 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2700 transitions. [2019-10-22 11:25:05,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2700 transitions. [2019-10-22 11:25:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:25:05,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,959 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:25:05,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2077878383, now seen corresponding path program 1 times [2019-10-22 11:25:05,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698080211] [2019-10-22 11:25:05,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:25:06,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698080211] [2019-10-22 11:25:06,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:06,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:06,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255556849] [2019-10-22 11:25:06,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:06,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:06,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:06,038 INFO L87 Difference]: Start difference. First operand 2264 states and 2700 transitions. Second operand 5 states. [2019-10-22 11:25:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,236 INFO L93 Difference]: Finished difference Result 4182 states and 5007 transitions. [2019-10-22 11:25:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:06,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-10-22 11:25:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,244 INFO L225 Difference]: With dead ends: 4182 [2019-10-22 11:25:06,244 INFO L226 Difference]: Without dead ends: 1933 [2019-10-22 11:25:06,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-10-22 11:25:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1745. [2019-10-22 11:25:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-10-22 11:25:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2049 transitions. [2019-10-22 11:25:06,327 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2049 transitions. Word has length 94 [2019-10-22 11:25:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,327 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 2049 transitions. [2019-10-22 11:25:06,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2049 transitions. [2019-10-22 11:25:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:25:06,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:06,329 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:25:06,330 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash -267062732, now seen corresponding path program 1 times [2019-10-22 11:25:06,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:06,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543691252] [2019-10-22 11:25:06,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:06,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543691252] [2019-10-22 11:25:06,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:06,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:06,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032199427] [2019-10-22 11:25:06,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:06,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:06,375 INFO L87 Difference]: Start difference. First operand 1745 states and 2049 transitions. Second operand 3 states. [2019-10-22 11:25:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,459 INFO L93 Difference]: Finished difference Result 2952 states and 3474 transitions. [2019-10-22 11:25:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:06,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-22 11:25:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,464 INFO L225 Difference]: With dead ends: 2952 [2019-10-22 11:25:06,464 INFO L226 Difference]: Without dead ends: 1232 [2019-10-22 11:25:06,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-10-22 11:25:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1224. [2019-10-22 11:25:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-10-22 11:25:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1403 transitions. [2019-10-22 11:25:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1403 transitions. Word has length 94 [2019-10-22 11:25:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,521 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1403 transitions. [2019-10-22 11:25:06,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1403 transitions. [2019-10-22 11:25:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 11:25:06,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:06,522 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:25:06,522 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1230973766, now seen corresponding path program 1 times [2019-10-22 11:25:06,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:06,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427259627] [2019-10-22 11:25:06,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:25:06,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427259627] [2019-10-22 11:25:06,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:06,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:06,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961465700] [2019-10-22 11:25:06,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:06,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:06,578 INFO L87 Difference]: Start difference. First operand 1224 states and 1403 transitions. Second operand 5 states. [2019-10-22 11:25:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,716 INFO L93 Difference]: Finished difference Result 2222 states and 2544 transitions. [2019-10-22 11:25:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:06,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-10-22 11:25:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,720 INFO L225 Difference]: With dead ends: 2222 [2019-10-22 11:25:06,720 INFO L226 Difference]: Without dead ends: 648 [2019-10-22 11:25:06,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-22 11:25:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 582. [2019-10-22 11:25:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-22 11:25:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2019-10-22 11:25:06,760 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 95 [2019-10-22 11:25:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,760 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2019-10-22 11:25:06,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2019-10-22 11:25:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 11:25:06,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:06,761 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:25:06,762 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2019-10-22 11:25:06,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:06,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067672742] [2019-10-22 11:25:06,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:25:06,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067672742] [2019-10-22 11:25:06,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:06,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:06,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421304051] [2019-10-22 11:25:06,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:06,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:06,900 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2019-10-22 11:25:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,944 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2019-10-22 11:25:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:06,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-22 11:25:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,945 INFO L225 Difference]: With dead ends: 586 [2019-10-22 11:25:06,945 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:06,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:06,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-10-22 11:25:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,949 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:06,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:06,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:06,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:25:08,389 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:08,684 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:08,945 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:09,190 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:09,473 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:09,723 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:09,928 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-10-22 11:25:10,156 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:10,712 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:10,995 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:11,196 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-10-22 11:25:11,501 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:11,706 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:11,846 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-10-22 11:25:12,038 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-22 11:25:12,265 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-22 11:25:12,502 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:12,684 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:12,949 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:13,109 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:13,257 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:13,424 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:13,583 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-22 11:25:13,723 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-22 11:25:13,878 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-22 11:25:14,039 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:14,229 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:25:14,483 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-10-22 11:25:14,799 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-10-22 11:25:15,031 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-10-22 11:25:15,034 INFO L439 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,034 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-10-22 11:25:15,035 INFO L439 ceAbstractionStarter]: At program point L400(lines 384 402) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,035 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-10-22 11:25:15,035 INFO L439 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (and (<= 2 ~E_M~0) (= 1 ~t1_pc~0) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~T1_E~0) (< ~local~0 ~token~0) (= ~t1_i~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~t1_st~0) (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) (<= 2 ~E_1~0) (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) [2019-10-22 11:25:15,035 INFO L443 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-10-22 11:25:15,035 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-10-22 11:25:15,035 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-10-22 11:25:15,036 INFO L439 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,036 INFO L439 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,036 INFO L439 ceAbstractionStarter]: At program point L471(lines 462 473) the Hoare annotation is: (= ~t1_i~0 1) [2019-10-22 11:25:15,036 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-10-22 11:25:15,036 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,037 INFO L443 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,037 INFO L443 ceAbstractionStarter]: For program point L309-3(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,037 INFO L439 ceAbstractionStarter]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,037 INFO L439 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-10-22 11:25:15,037 INFO L443 ceAbstractionStarter]: For program point L309-5(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,037 INFO L439 ceAbstractionStarter]: At program point L144-1(lines 132 146) the Hoare annotation is: (let ((.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~t1_i~0 1))) (let ((.cse2 (and .cse7 .cse8 .cse9)) (.cse5 (<= 2 ~t1_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse5 .cse6 (<= ~local~0 ~token~0)) (and .cse0 .cse7 (not .cse1) .cse8 .cse3 .cse4 .cse9 (= 0 ~t1_st~0) .cse6)))) [2019-10-22 11:25:15,038 INFO L443 ceAbstractionStarter]: For program point L309-6(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,038 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-10-22 11:25:15,038 INFO L439 ceAbstractionStarter]: At program point L144-2(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse4))) [2019-10-22 11:25:15,038 INFO L443 ceAbstractionStarter]: For program point L309-8(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,038 INFO L439 ceAbstractionStarter]: At program point L144-3(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse14 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse14 .cse8 .cse3 .cse15 .cse5 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse8 .cse3 .cse15 .cse9 .cse5 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse11 .cse12)))) [2019-10-22 11:25:15,038 INFO L443 ceAbstractionStarter]: For program point L309-9(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,038 INFO L439 ceAbstractionStarter]: At program point L144-4(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse14 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse14 .cse8 .cse3 .cse16 .cse5 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse7 .cse8 .cse3 .cse16 .cse9 .cse5 .cse10 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse16 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse16 .cse5 .cse15 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse16 .cse5 .cse6 .cse11 .cse12)))) [2019-10-22 11:25:15,039 INFO L443 ceAbstractionStarter]: For program point L309-11(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,039 INFO L443 ceAbstractionStarter]: For program point L309-12(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,039 INFO L443 ceAbstractionStarter]: For program point L309-14(lines 309 313) no Hoare annotation was computed. [2019-10-22 11:25:15,039 INFO L439 ceAbstractionStarter]: At program point L343(lines 337 345) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,039 INFO L443 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-10-22 11:25:15,039 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-10-22 11:25:15,039 INFO L443 ceAbstractionStarter]: For program point L277-3(lines 276 299) no Hoare annotation was computed. [2019-10-22 11:25:15,040 INFO L439 ceAbstractionStarter]: At program point L145(lines 129 147) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-10-22 11:25:15,040 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 178 188) no Hoare annotation was computed. [2019-10-22 11:25:15,040 INFO L439 ceAbstractionStarter]: At program point L145-1(lines 129 147) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse9 (= ~t1_i~0 1))) (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (and .cse6 .cse7 .cse9)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0)) (and .cse0 .cse6 (not .cse1) .cse7 .cse3 .cse8 .cse9 .cse10 (= 0 ~t1_st~0) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5)))) [2019-10-22 11:25:15,041 INFO L443 ceAbstractionStarter]: For program point L178-2(lines 178 188) no Hoare annotation was computed. [2019-10-22 11:25:15,042 INFO L439 ceAbstractionStarter]: At program point L145-2(lines 129 147) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse7 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4))) [2019-10-22 11:25:15,042 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-22 11:25:15,042 INFO L439 ceAbstractionStarter]: At program point L145-3(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse17 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse16 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse0 .cse17 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse12 .cse13) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse12 .cse13)))) [2019-10-22 11:25:15,042 INFO L439 ceAbstractionStarter]: At program point L145-4(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse17 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse16 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse0 .cse17 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse12 .cse13) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse12 .cse13)))) [2019-10-22 11:25:15,042 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,043 INFO L443 ceAbstractionStarter]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,044 INFO L443 ceAbstractionStarter]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-10-22 11:25:15,044 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-10-22 11:25:15,044 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-10-22 11:25:15,044 INFO L439 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= 1 ~t1_pc~0) .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 (<= ~local~0 ~token~0) .cse7))) [2019-10-22 11:25:15,045 INFO L443 ceAbstractionStarter]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-10-22 11:25:15,045 INFO L443 ceAbstractionStarter]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-10-22 11:25:15,045 INFO L443 ceAbstractionStarter]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-10-22 11:25:15,045 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-10-22 11:25:15,045 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 182 187) no Hoare annotation was computed. [2019-10-22 11:25:15,045 INFO L443 ceAbstractionStarter]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2019-10-22 11:25:15,045 INFO L439 ceAbstractionStarter]: At program point L381(lines 374 383) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= 1 ~t1_pc~0)) (<= 2 ~T1_E~0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L282-3(lines 276 299) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L249-4(lines 248 271) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-10-22 11:25:15,046 INFO L443 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-10-22 11:25:15,047 INFO L439 ceAbstractionStarter]: At program point L317-2(lines 277 281) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-10-22 11:25:15,047 INFO L443 ceAbstractionStarter]: For program point L317-3(lines 317 321) no Hoare annotation was computed. [2019-10-22 11:25:15,047 INFO L439 ceAbstractionStarter]: At program point L317-5(lines 1 473) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse8 (= 0 ~t1_st~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 (<= 2 ~t1_st~0) .cse6 .cse7) (and .cse0 .cse2 (not .cse1) .cse3 .cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse4 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse1 .cse3 .cse5 (<= ~token~0 ~local~0) .cse4 .cse8 .cse6 (<= ~local~0 ~token~0)))) [2019-10-22 11:25:15,047 INFO L443 ceAbstractionStarter]: For program point L317-6(lines 317 321) no Hoare annotation was computed. [2019-10-22 11:25:15,047 INFO L439 ceAbstractionStarter]: At program point L317-8(lines 1 473) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4 .cse8) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse7 .cse4 .cse8))) [2019-10-22 11:25:15,047 INFO L443 ceAbstractionStarter]: For program point L317-9(lines 317 321) no Hoare annotation was computed. [2019-10-22 11:25:15,048 INFO L439 ceAbstractionStarter]: At program point L317-11(lines 277 281) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,048 INFO L443 ceAbstractionStarter]: For program point L317-12(lines 317 321) no Hoare annotation was computed. [2019-10-22 11:25:15,049 INFO L439 ceAbstractionStarter]: At program point L317-14(lines 350 354) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,049 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-10-22 11:25:15,049 INFO L439 ceAbstractionStarter]: At program point L153(lines 160 164) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= 1 ~t1_pc~0)) (<= 2 ~T1_E~0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-10-22 11:25:15,050 INFO L439 ceAbstractionStarter]: At program point L153-1(lines 148 155) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,050 INFO L439 ceAbstractionStarter]: At program point L418-1(lines 273 455) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,050 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:25:15,050 INFO L443 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-10-22 11:25:15,050 INFO L443 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-10-22 11:25:15,050 INFO L443 ceAbstractionStarter]: For program point L287-3(lines 276 299) no Hoare annotation was computed. [2019-10-22 11:25:15,050 INFO L443 ceAbstractionStarter]: For program point L254-3(lines 248 271) no Hoare annotation was computed. [2019-10-22 11:25:15,051 INFO L439 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse9 (<= 2 ~m_st~0)) (.cse10 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (= ~m_st~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse8 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~t1_i~0 1)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and (= 1 ~t1_pc~0) (<= ~token~0 (+ ~local~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (< ~local~0 ~token~0) .cse5 .cse6 .cse7) (and .cse5 .cse6 (and .cse0 .cse1 .cse8 .cse9 .cse3 .cse4) .cse7) (and .cse10 .cse0 .cse1 .cse11 .cse8 .cse9 .cse3 .cse4 .cse12) (and .cse10 .cse2 .cse11 .cse8 .cse3 .cse7 .cse0 .cse1 (<= ~token~0 ~local~0) .cse5 .cse6 .cse4 .cse12 (<= ~local~0 ~token~0)))) [2019-10-22 11:25:15,051 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-10-22 11:25:15,051 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-10-22 11:25:15,051 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:25:15,051 INFO L439 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,052 INFO L439 ceAbstractionStarter]: At program point L190-1(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,052 INFO L439 ceAbstractionStarter]: At program point L190-2(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,053 INFO L439 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,053 INFO L439 ceAbstractionStarter]: At program point L191(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,053 INFO L439 ceAbstractionStarter]: At program point L191-1(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,054 INFO L439 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-10-22 11:25:15,054 INFO L439 ceAbstractionStarter]: At program point L191-2(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,054 INFO L439 ceAbstractionStarter]: At program point L125-1(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 (= 0 ~t1_st~0) .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 (<= ~local~0 ~token~0)))) [2019-10-22 11:25:15,054 INFO L439 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse5 (<= 2 ~t1_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse9 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse8) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) (not .cse1) (= 0 ULTIMATE.start_activate_threads_~tmp~1) .cse9 .cse3 (= 0 ~t1_st~0) .cse8 .cse0 .cse2 .cse4 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)))) [2019-10-22 11:25:15,055 INFO L439 ceAbstractionStarter]: At program point L125-2(lines 113 127) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-10-22 11:25:15,055 INFO L439 ceAbstractionStarter]: At program point L125-3(lines 113 127) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse15 (not .cse0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t1_st~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_1~0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse6 .cse2 .cse13 .cse3 .cse14 .cse10 .cse11) (and .cse5 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse1 (< ~local~0 ~token~0) .cse3 .cse8 .cse9 .cse4 .cse10 .cse11) (and .cse5 .cse6 .cse2 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse15 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse15 .cse6 .cse13 .cse3 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse5 .cse0 .cse6 .cse13 .cse7 .cse3 .cse14 .cse10 .cse11 .cse12) (and .cse5 .cse0 .cse6 .cse13 .cse3 .cse4 .cse10 .cse11)))) [2019-10-22 11:25:15,055 INFO L439 ceAbstractionStarter]: At program point L125-4(lines 113 127) the Hoare annotation is: (let ((.cse8 (= 1 ~t1_pc~0))) (let ((.cse10 (<= 2 ~t1_st~0)) (.cse9 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse15 (not .cse8)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse5 (= 0 ~t1_st~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 .cse4 .cse10 .cse0 .cse1 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse9 (< ~local~0 ~token~0) .cse4 .cse12 .cse13 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse12 .cse13 .cse10 .cse6 .cse7) (and .cse15 .cse9 .cse2 .cse4 .cse5 .cse0 .cse1 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse15 .cse1 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7 .cse14)))) [2019-10-22 11:25:15,055 INFO L439 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (= ~t1_i~0 1) [2019-10-22 11:25:15,056 INFO L439 ceAbstractionStarter]: At program point L126(lines 110 128) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse6 (<= 2 ~T1_E~0)) (.cse2 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse7 (<= 2 ~M_E~0)) (.cse4 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) .cse7 .cse8 .cse9 (<= ~local~0 ~token~0)) (and .cse5 .cse0 .cse1 .cse6 .cse2 (<= 2 ~m_st~0) .cse3 .cse7 .cse4 .cse8 .cse9))) [2019-10-22 11:25:15,056 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 110 128) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 (<= 2 ~t1_st~0) .cse7 (<= ~local~0 ~token~0)))) [2019-10-22 11:25:15,057 INFO L439 ceAbstractionStarter]: At program point L126-2(lines 110 128) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse0 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6))) [2019-10-22 11:25:15,057 INFO L439 ceAbstractionStarter]: At program point L126-3(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.cse1 (not .cse14)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse16 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse15 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse0 .cse1 .cse7 .cse16 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12) (and .cse6 .cse0 .cse14 .cse7 .cse8 .cse16 .cse4 .cse5 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse7 .cse3 .cse16 .cse4 .cse15 .cse11 .cse12) (and .cse6 .cse0 .cse14 .cse7 .cse16 .cse4 .cse15 .cse11 .cse12) (and .cse6 .cse0 .cse7 .cse3 .cse16 .cse4 .cse5 .cse11 .cse12)))) [2019-10-22 11:25:15,057 INFO L439 ceAbstractionStarter]: At program point L126-4(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.cse1 (not .cse14)) (.cse16 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse13 (<= ~local~0 ~token~0)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse14 .cse7 .cse15 .cse4 .cse9 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse14 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse7 .cse15 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12) (and .cse6 .cse0 .cse7 .cse3 .cse15 .cse4 .cse16 .cse11 .cse12) (and .cse0 .cse6 .cse7 .cse15 .cse8 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse7 .cse3 .cse15 .cse4 .cse5 .cse11 .cse12)))) [2019-10-22 11:25:15,057 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-10-22 11:25:15,058 INFO L439 ceAbstractionStarter]: At program point L292-3(lines 273 300) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-10-22 11:25:15,058 INFO L443 ceAbstractionStarter]: For program point L259-3(lines 248 271) no Hoare annotation was computed. [2019-10-22 11:25:15,058 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-10-22 11:25:15,058 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:25:15,058 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-10-22 11:25:15,058 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-10-22 11:25:15,058 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-10-22 11:25:15,059 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:25:15,059 INFO L439 ceAbstractionStarter]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7))) [2019-10-22 11:25:15,059 INFO L439 ceAbstractionStarter]: At program point L264-3(lines 245 272) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-10-22 11:25:15,059 INFO L439 ceAbstractionStarter]: At program point L165-1(lines 249 253) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7))) [2019-10-22 11:25:15,059 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,059 INFO L443 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,060 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-10-22 11:25:15,060 INFO L443 ceAbstractionStarter]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,060 INFO L443 ceAbstractionStarter]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,060 INFO L443 ceAbstractionStarter]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,060 INFO L443 ceAbstractionStarter]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-10-22 11:25:15,061 INFO L443 ceAbstractionStarter]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-10-22 11:25:15,062 INFO L443 ceAbstractionStarter]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-10-22 11:25:15,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:15 BoogieIcfgContainer [2019-10-22 11:25:15,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:15,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:15,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:15,162 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:15,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:03" (3/4) ... [2019-10-22 11:25:15,167 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:15,183 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:25:15,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:25:15,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) || (((((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && m_pc == 0) && token <= local) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && local <= token) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == t1_pc && token <= local + 1) && (((2 <= E_M && 2 <= T1_E) && m_st == 0) && t1_i == 1) && 2 <= E_1) && local < token) && __retres1 == 0) && 0 == \result) && tmp___0 == 0) || (((__retres1 == 0 && 0 == \result) && ((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && tmp___0 == 0)) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && m_st == 0) && m_pc == 0) && 0 == tmp) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) [2019-10-22 11:25:15,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0 [2019-10-22 11:25:15,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && local <= token) && __retres1 == 0) [2019-10-22 11:25:15,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) [2019-10-22 11:25:15,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || ((((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) [2019-10-22 11:25:15,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= E_1)) || (((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 2 <= E_1) [2019-10-22 11:25:15,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1)) || (((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) [2019-10-22 11:25:15,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 2 <= t1_st) && __retres1 == 0) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token)) || ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) [2019-10-22 11:25:15,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token) || (((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0)) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) [2019-10-22 11:25:15,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || (((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) [2019-10-22 11:25:15,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && 2 <= t1_st) && __retres1 == 0) && tmp___0 == 0) || ((((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) && tmp___0 == 0)) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) && local <= token) [2019-10-22 11:25:15,225 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,225 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) || ((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token) [2019-10-22 11:25:15,225 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,225 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,225 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,225 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,226 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,226 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,226 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-10-22 11:25:15,290 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_62272ce6-b70d-45cd-968d-e264553fb5f6/bin/utaipan/witness.graphml [2019-10-22 11:25:15,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:15,294 INFO L168 Benchmark]: Toolchain (without parser) took 13367.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 942.4 MB in the beginning and 1.3 GB in the end (delta: -336.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:15,295 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:15,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:15,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:15,296 INFO L168 Benchmark]: Boogie Preprocessor took 68.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:15,296 INFO L168 Benchmark]: RCFGBuilder took 894.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:15,296 INFO L168 Benchmark]: TraceAbstraction took 11832.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -204.1 MB). Peak memory consumption was 438.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:15,297 INFO L168 Benchmark]: Witness Printer took 131.55 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:15,298 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 894.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11832.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -204.1 MB). Peak memory consumption was 438.3 MB. Max. memory is 11.5 GB. * Witness Printer took 131.55 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 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: 462]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) || (((((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && m_pc == 0) && token <= local) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && local <= token) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((2 <= T1_E && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || (((((1 == t1_pc && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) || ((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 2 <= t1_st) && __retres1 == 0) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token)) || ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((0 == \result && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && local <= token) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || ((((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((1 == t1_pc && token <= local + 1) && (((2 <= E_M && 2 <= T1_E) && m_st == 0) && t1_i == 1) && 2 <= E_1) && local < token) && __retres1 == 0) && 0 == \result) && tmp___0 == 0) || (((__retres1 == 0 && 0 == \result) && ((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && tmp___0 == 0)) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && m_st == 0) && m_pc == 0) && 0 == tmp) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= E_1)) || (((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1)) || (((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token) || (((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0)) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && 2 <= t1_st) && __retres1 == 0) && tmp___0 == 0) || ((((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) && tmp___0 == 0)) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) && local <= token) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || (((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, HoareTripleCheckerStatistics: 3044 SDtfs, 2703 SDslu, 1946 SDs, 0 SdLazy, 243 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2312occurred 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: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 394 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 650 NumberOfFragments, 10241 HoareAnnotationTreeSize, 52 FomulaSimplifications, 19155 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 628 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 126390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 203/203 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...