./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/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer --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 Automizer --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-11-15 21:31:40,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:31:40,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:31:40,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:31:40,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:31:40,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:31:40,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:31:40,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:31:40,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:31:40,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:31:40,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:31:40,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:31:40,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:31:40,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:31:40,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:31:40,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:31:40,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:31:40,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:31:40,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:31:40,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:31:40,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:31:40,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:31:40,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:31:40,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:31:40,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:31:40,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:31:40,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:31:40,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:31:40,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:31:40,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:31:40,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:31:40,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:31:40,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:31:40,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:31:40,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:31:40,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:31:40,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:31:40,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:31:40,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:31:40,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:31:40,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:31:40,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:31:40,640 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:31:40,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:31:40,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:31:40,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:31:40,642 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:31:40,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:31:40,642 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:31:40,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:31:40,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:31:40,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:31:40,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:31:40,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:31:40,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:31:40,645 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:31:40,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:31:40,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:31:40,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:31:40,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:31:40,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:31:40,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:31:40,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:31:40,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:31:40,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:31:40,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:31:40,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:31:40,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:31:40,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:31:40,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:31:40,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer 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 -> Automizer 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-11-15 21:31:40,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:31:40,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:31:40,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:31:40,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:31:40,705 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:31:40,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-11-15 21:31:40,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/data/b65cee69e/b74b45c1ba7b43daae6f81006c698b81/FLAGa7794d4e9 [2019-11-15 21:31:41,194 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:31:41,195 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-11-15 21:31:41,211 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/data/b65cee69e/b74b45c1ba7b43daae6f81006c698b81/FLAGa7794d4e9 [2019-11-15 21:31:41,561 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/data/b65cee69e/b74b45c1ba7b43daae6f81006c698b81 [2019-11-15 21:31:41,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:31:41,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:31:41,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:31:41,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:31:41,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:31:41,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df1a1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41, skipping insertion in model container [2019-11-15 21:31:41,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,578 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:31:41,612 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:31:41,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:31:41,851 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:31:41,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:31:41,909 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:31:41,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41 WrapperNode [2019-11-15 21:31:41,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:31:41,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:31:41,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:31:41,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:31:41,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:31:41,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:31:41,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:31:41,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:31:41,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... [2019-11-15 21:31:41,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:31:41,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:31:41,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:31:41,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:31:41,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/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-11-15 21:31:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:31:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:31:42,707 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:31:42,708 INFO L284 CfgBuilder]: Removed 80 assume(true) statements. [2019-11-15 21:31:42,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:31:42 BoogieIcfgContainer [2019-11-15 21:31:42,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:31:42,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:31:42,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:31:42,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:31:42,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:31:41" (1/3) ... [2019-11-15 21:31:42,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8310f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:31:42, skipping insertion in model container [2019-11-15 21:31:42,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:31:41" (2/3) ... [2019-11-15 21:31:42,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8310f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:31:42, skipping insertion in model container [2019-11-15 21:31:42,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:31:42" (3/3) ... [2019-11-15 21:31:42,726 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-11-15 21:31:42,739 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:31:42,744 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:31:42,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:31:42,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:31:42,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:31:42,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:31:42,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:31:42,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:31:42,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:31:42,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:31:42,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:31:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-15 21:31:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:31:42,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:42,796 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-11-15 21:31:42,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-15 21:31:42,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:42,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289138519] [2019-11-15 21:31:42,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:42,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:42,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:42,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289138519] [2019-11-15 21:31:42,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:42,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:42,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488002098] [2019-11-15 21:31:42,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:42,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:42,955 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-11-15 21:31:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:43,001 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2019-11-15 21:31:43,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:43,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:31:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:43,014 INFO L225 Difference]: With dead ends: 277 [2019-11-15 21:31:43,014 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 21:31:43,017 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-11-15 21:31:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 21:31:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-15 21:31:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:31:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-11-15 21:31:43,064 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2019-11-15 21:31:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:43,064 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-11-15 21:31:43,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-11-15 21:31:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:31:43,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:43,066 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-11-15 21:31:43,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:43,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-15 21:31:43,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:43,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980559283] [2019-11-15 21:31:43,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:43,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980559283] [2019-11-15 21:31:43,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:43,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:31:43,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047589430] [2019-11-15 21:31:43,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:43,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:43,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:43,117 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2019-11-15 21:31:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:43,189 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2019-11-15 21:31:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:43,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:31:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:43,192 INFO L225 Difference]: With dead ends: 363 [2019-11-15 21:31:43,192 INFO L226 Difference]: Without dead ends: 232 [2019-11-15 21:31:43,194 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-11-15 21:31:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-15 21:31:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-11-15 21:31:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 21:31:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-11-15 21:31:43,228 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2019-11-15 21:31:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:43,229 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-11-15 21:31:43,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-11-15 21:31:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:31:43,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:43,230 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-11-15 21:31:43,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-15 21:31:43,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:43,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623287288] [2019-11-15 21:31:43,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:43,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623287288] [2019-11-15 21:31:43,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:43,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:31:43,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312827318] [2019-11-15 21:31:43,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:43,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:43,276 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-11-15 21:31:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:43,342 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2019-11-15 21:31:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:43,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:31:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:43,345 INFO L225 Difference]: With dead ends: 453 [2019-11-15 21:31:43,345 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 21:31:43,347 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-11-15 21:31:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 21:31:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-15 21:31:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 21:31:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2019-11-15 21:31:43,370 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2019-11-15 21:31:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:43,370 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2019-11-15 21:31:43,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2019-11-15 21:31:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:31:43,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:43,372 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-11-15 21:31:43,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-15 21:31:43,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:43,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331239314] [2019-11-15 21:31:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:43,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331239314] [2019-11-15 21:31:43,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:43,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:31:43,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562552014] [2019-11-15 21:31:43,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:43,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:43,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:43,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:43,404 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand 3 states. [2019-11-15 21:31:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:43,509 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2019-11-15 21:31:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:43,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:31:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:43,512 INFO L225 Difference]: With dead ends: 452 [2019-11-15 21:31:43,512 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 21:31:43,516 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-11-15 21:31:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 21:31:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-15 21:31:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 21:31:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2019-11-15 21:31:43,549 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2019-11-15 21:31:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:43,549 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2019-11-15 21:31:43,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2019-11-15 21:31:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:31:43,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:43,551 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-11-15 21:31:43,551 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-15 21:31:43,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:43,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655304173] [2019-11-15 21:31:43,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:43,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655304173] [2019-11-15 21:31:43,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:43,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:31:43,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78846185] [2019-11-15 21:31:43,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:43,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:43,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:43,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:43,623 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 3 states. [2019-11-15 21:31:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:43,666 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2019-11-15 21:31:43,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:43,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:31:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:43,669 INFO L225 Difference]: With dead ends: 451 [2019-11-15 21:31:43,669 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 21:31:43,670 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-11-15 21:31:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 21:31:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-15 21:31:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 21:31:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 305 transitions. [2019-11-15 21:31:43,700 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 305 transitions. Word has length 39 [2019-11-15 21:31:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:43,701 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 305 transitions. [2019-11-15 21:31:43,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2019-11-15 21:31:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:31:43,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:43,705 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-11-15 21:31:43,705 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-15 21:31:43,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:43,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007890704] [2019-11-15 21:31:43,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:43,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007890704] [2019-11-15 21:31:43,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:43,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:31:43,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941225726] [2019-11-15 21:31:43,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:43,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:43,761 INFO L87 Difference]: Start difference. First operand 230 states and 305 transitions. Second operand 3 states. [2019-11-15 21:31:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:43,815 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2019-11-15 21:31:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:43,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:31:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:43,818 INFO L225 Difference]: With dead ends: 638 [2019-11-15 21:31:43,818 INFO L226 Difference]: Without dead ends: 419 [2019-11-15 21:31:43,819 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-11-15 21:31:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-11-15 21:31:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2019-11-15 21:31:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-15 21:31:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 517 transitions. [2019-11-15 21:31:43,842 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 517 transitions. Word has length 39 [2019-11-15 21:31:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:43,843 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 517 transitions. [2019-11-15 21:31:43,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 517 transitions. [2019-11-15 21:31:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:31:43,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:43,845 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-11-15 21:31:43,845 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1499945056, now seen corresponding path program 1 times [2019-11-15 21:31:43,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:43,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356524129] [2019-11-15 21:31:43,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:43,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:43,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356524129] [2019-11-15 21:31:43,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:43,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:43,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831775882] [2019-11-15 21:31:43,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:43,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:43,934 INFO L87 Difference]: Start difference. First operand 395 states and 517 transitions. Second operand 3 states. [2019-11-15 21:31:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:44,010 INFO L93 Difference]: Finished difference Result 1095 states and 1440 transitions. [2019-11-15 21:31:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:44,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 21:31:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:44,015 INFO L225 Difference]: With dead ends: 1095 [2019-11-15 21:31:44,015 INFO L226 Difference]: Without dead ends: 717 [2019-11-15 21:31:44,016 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-11-15 21:31:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-15 21:31:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 687. [2019-11-15 21:31:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-11-15 21:31:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 897 transitions. [2019-11-15 21:31:44,056 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 897 transitions. Word has length 63 [2019-11-15 21:31:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:44,057 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 897 transitions. [2019-11-15 21:31:44,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 897 transitions. [2019-11-15 21:31:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:31:44,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:44,059 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-11-15 21:31:44,059 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1803857567, now seen corresponding path program 1 times [2019-11-15 21:31:44,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:44,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143751574] [2019-11-15 21:31:44,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:44,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:44,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:44,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143751574] [2019-11-15 21:31:44,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:44,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:44,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705343409] [2019-11-15 21:31:44,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:44,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:44,135 INFO L87 Difference]: Start difference. First operand 687 states and 897 transitions. Second operand 3 states. [2019-11-15 21:31:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:44,229 INFO L93 Difference]: Finished difference Result 1933 states and 2521 transitions. [2019-11-15 21:31:44,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:44,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 21:31:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:44,236 INFO L225 Difference]: With dead ends: 1933 [2019-11-15 21:31:44,237 INFO L226 Difference]: Without dead ends: 1271 [2019-11-15 21:31:44,238 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-11-15 21:31:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-11-15 21:31:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1257. [2019-11-15 21:31:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-11-15 21:31:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1607 transitions. [2019-11-15 21:31:44,305 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1607 transitions. Word has length 63 [2019-11-15 21:31:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:44,306 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 1607 transitions. [2019-11-15 21:31:44,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1607 transitions. [2019-11-15 21:31:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:31:44,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:44,308 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-11-15 21:31:44,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -45669778, now seen corresponding path program 1 times [2019-11-15 21:31:44,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:44,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130231695] [2019-11-15 21:31:44,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:44,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:44,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:44,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130231695] [2019-11-15 21:31:44,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:44,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:44,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336563763] [2019-11-15 21:31:44,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:44,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:44,377 INFO L87 Difference]: Start difference. First operand 1257 states and 1607 transitions. Second operand 3 states. [2019-11-15 21:31:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:44,526 INFO L93 Difference]: Finished difference Result 3544 states and 4519 transitions. [2019-11-15 21:31:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:44,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 21:31:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:44,539 INFO L225 Difference]: With dead ends: 3544 [2019-11-15 21:31:44,539 INFO L226 Difference]: Without dead ends: 2312 [2019-11-15 21:31:44,542 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-11-15 21:31:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-11-15 21:31:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2019-11-15 21:31:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-15 21:31:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2876 transitions. [2019-11-15 21:31:44,714 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2876 transitions. Word has length 64 [2019-11-15 21:31:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:44,715 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2876 transitions. [2019-11-15 21:31:44,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2876 transitions. [2019-11-15 21:31:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:31:44,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:44,719 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-11-15 21:31:44,719 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash 460727628, now seen corresponding path program 1 times [2019-11-15 21:31:44,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:44,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481165624] [2019-11-15 21:31:44,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:44,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:44,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 21:31:44,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481165624] [2019-11-15 21:31:44,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:44,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:44,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133131047] [2019-11-15 21:31:44,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:44,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:44,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:44,795 INFO L87 Difference]: Start difference. First operand 2312 states and 2876 transitions. Second operand 3 states. [2019-11-15 21:31:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:44,909 INFO L93 Difference]: Finished difference Result 4080 states and 5097 transitions. [2019-11-15 21:31:44,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:44,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-15 21:31:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:44,921 INFO L225 Difference]: With dead ends: 4080 [2019-11-15 21:31:44,921 INFO L226 Difference]: Without dead ends: 2324 [2019-11-15 21:31:44,924 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-11-15 21:31:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-11-15 21:31:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2264. [2019-11-15 21:31:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-15 21:31:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2740 transitions. [2019-11-15 21:31:45,020 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2740 transitions. Word has length 93 [2019-11-15 21:31:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:45,021 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2740 transitions. [2019-11-15 21:31:45,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2740 transitions. [2019-11-15 21:31:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:31:45,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:45,024 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-11-15 21:31:45,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:45,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -491999912, now seen corresponding path program 1 times [2019-11-15 21:31:45,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:45,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852094854] [2019-11-15 21:31:45,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:31:45,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852094854] [2019-11-15 21:31:45,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:45,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:45,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609373959] [2019-11-15 21:31:45,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:45,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:45,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:45,058 INFO L87 Difference]: Start difference. First operand 2264 states and 2740 transitions. Second operand 3 states. [2019-11-15 21:31:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:45,176 INFO L93 Difference]: Finished difference Result 4484 states and 5430 transitions. [2019-11-15 21:31:45,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:45,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 21:31:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:45,188 INFO L225 Difference]: With dead ends: 4484 [2019-11-15 21:31:45,188 INFO L226 Difference]: Without dead ends: 2266 [2019-11-15 21:31:45,191 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-11-15 21:31:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-11-15 21:31:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-11-15 21:31:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-15 21:31:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2700 transitions. [2019-11-15 21:31:45,289 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2700 transitions. Word has length 94 [2019-11-15 21:31:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:45,289 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2700 transitions. [2019-11-15 21:31:45,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2700 transitions. [2019-11-15 21:31:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:31:45,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:45,293 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-11-15 21:31:45,293 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2077878383, now seen corresponding path program 1 times [2019-11-15 21:31:45,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:45,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176664933] [2019-11-15 21:31:45,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:31:45,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176664933] [2019-11-15 21:31:45,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:45,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:31:45,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284865469] [2019-11-15 21:31:45,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:31:45,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:45,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:31:45,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:31:45,348 INFO L87 Difference]: Start difference. First operand 2264 states and 2700 transitions. Second operand 5 states. [2019-11-15 21:31:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:45,532 INFO L93 Difference]: Finished difference Result 4182 states and 5007 transitions. [2019-11-15 21:31:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:31:45,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 21:31:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:45,543 INFO L225 Difference]: With dead ends: 4182 [2019-11-15 21:31:45,543 INFO L226 Difference]: Without dead ends: 1933 [2019-11-15 21:31:45,546 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-11-15 21:31:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-11-15 21:31:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1745. [2019-11-15 21:31:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-11-15 21:31:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2049 transitions. [2019-11-15 21:31:45,645 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2049 transitions. Word has length 94 [2019-11-15 21:31:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:45,645 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 2049 transitions. [2019-11-15 21:31:45,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:31:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2049 transitions. [2019-11-15 21:31:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:31:45,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:45,648 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-11-15 21:31:45,648 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -267062732, now seen corresponding path program 1 times [2019-11-15 21:31:45,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:45,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365758044] [2019-11-15 21:31:45,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:31:45,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365758044] [2019-11-15 21:31:45,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:45,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:31:45,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260569274] [2019-11-15 21:31:45,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:31:45,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:31:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:31:45,698 INFO L87 Difference]: Start difference. First operand 1745 states and 2049 transitions. Second operand 3 states. [2019-11-15 21:31:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:45,808 INFO L93 Difference]: Finished difference Result 2952 states and 3474 transitions. [2019-11-15 21:31:45,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:31:45,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 21:31:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:45,818 INFO L225 Difference]: With dead ends: 2952 [2019-11-15 21:31:45,818 INFO L226 Difference]: Without dead ends: 1232 [2019-11-15 21:31:45,821 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-11-15 21:31:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-15 21:31:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1224. [2019-11-15 21:31:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-15 21:31:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1403 transitions. [2019-11-15 21:31:45,899 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1403 transitions. Word has length 94 [2019-11-15 21:31:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:45,899 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1403 transitions. [2019-11-15 21:31:45,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:31:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1403 transitions. [2019-11-15 21:31:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:31:45,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:45,902 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-11-15 21:31:45,902 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:45,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1230973766, now seen corresponding path program 1 times [2019-11-15 21:31:45,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:45,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323960220] [2019-11-15 21:31:45,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:45,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:31:46,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323960220] [2019-11-15 21:31:46,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:46,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:31:46,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101285327] [2019-11-15 21:31:46,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:31:46,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:31:46,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:31:46,012 INFO L87 Difference]: Start difference. First operand 1224 states and 1403 transitions. Second operand 5 states. [2019-11-15 21:31:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:46,149 INFO L93 Difference]: Finished difference Result 2222 states and 2544 transitions. [2019-11-15 21:31:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:31:46,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 21:31:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:46,152 INFO L225 Difference]: With dead ends: 2222 [2019-11-15 21:31:46,153 INFO L226 Difference]: Without dead ends: 648 [2019-11-15 21:31:46,154 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-11-15 21:31:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-15 21:31:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 582. [2019-11-15 21:31:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-15 21:31:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2019-11-15 21:31:46,187 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 95 [2019-11-15 21:31:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:46,187 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2019-11-15 21:31:46,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:31:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2019-11-15 21:31:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:31:46,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:46,189 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-11-15 21:31:46,189 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2019-11-15 21:31:46,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:46,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893114856] [2019-11-15 21:31:46,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:46,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:46,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:31:46,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893114856] [2019-11-15 21:31:46,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:31:46,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:31:46,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218148590] [2019-11-15 21:31:46,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:31:46,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:31:46,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:31:46,306 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2019-11-15 21:31:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:46,353 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2019-11-15 21:31:46,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:31:46,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:31:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:46,355 INFO L225 Difference]: With dead ends: 586 [2019-11-15 21:31:46,355 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:31:46,357 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-11-15 21:31:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:31:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:31:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:31:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:31:46,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-15 21:31:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:46,358 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:31:46,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:31:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:31:46,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:31:46,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:31:47,621 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:47,920 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:48,213 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:48,480 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:48,790 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:49,052 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:49,291 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 21:31:49,557 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:49,660 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 21:31:50,157 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:50,443 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:50,675 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 21:31:51,019 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:51,259 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:51,394 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-11-15 21:31:51,625 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:31:51,872 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:31:52,104 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:52,265 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:52,541 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:52,721 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:52,896 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:53,073 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:53,225 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:31:53,377 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:31:53,543 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-15 21:31:53,721 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:53,946 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:31:54,115 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-15 21:31:54,224 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-15 21:31:54,392 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-11-15 21:31:54,580 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 21:31:54,799 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 21:31:54,801 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-11-15 21:31:54,802 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 21:31:54,802 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-11-15 21:31:54,802 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-15 21:31:54,802 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-11-15 21:31:54,802 INFO L443 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-11-15 21:31:54,803 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-11-15 21:31:54,803 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-11-15 21:31:54,803 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-11-15 21:31:54,804 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-11-15 21:31:54,804 INFO L439 ceAbstractionStarter]: At program point L471(lines 462 473) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-15 21:31:54,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-15 21:31:54,804 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-15 21:31:54,804 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,804 INFO L443 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,804 INFO L443 ceAbstractionStarter]: For program point L309-3(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,805 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-11-15 21:31:54,805 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-11-15 21:31:54,805 INFO L443 ceAbstractionStarter]: For program point L309-5(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,805 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-11-15 21:31:54,805 INFO L443 ceAbstractionStarter]: For program point L309-6(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,805 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-11-15 21:31:54,806 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-11-15 21:31:54,806 INFO L443 ceAbstractionStarter]: For program point L309-8(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,806 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-11-15 21:31:54,806 INFO L443 ceAbstractionStarter]: For program point L309-9(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,807 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-11-15 21:31:54,807 INFO L443 ceAbstractionStarter]: For program point L309-11(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,807 INFO L443 ceAbstractionStarter]: For program point L309-12(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,807 INFO L443 ceAbstractionStarter]: For program point L309-14(lines 309 313) no Hoare annotation was computed. [2019-11-15 21:31:54,807 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-11-15 21:31:54,808 INFO L443 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-11-15 21:31:54,808 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-11-15 21:31:54,808 INFO L443 ceAbstractionStarter]: For program point L277-3(lines 276 299) no Hoare annotation was computed. [2019-11-15 21:31:54,808 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-11-15 21:31:54,808 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 178 188) no Hoare annotation was computed. [2019-11-15 21:31:54,808 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-11-15 21:31:54,808 INFO L443 ceAbstractionStarter]: For program point L178-2(lines 178 188) no Hoare annotation was computed. [2019-11-15 21:31:54,809 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-11-15 21:31:54,809 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:31:54,809 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-11-15 21:31:54,810 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-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,810 INFO L443 ceAbstractionStarter]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-11-15 21:31:54,811 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-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-11-15 21:31:54,811 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 182 187) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2019-11-15 21:31:54,812 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-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L282-3(lines 276 299) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L249-4(lines 248 271) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:31:54,812 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-11-15 21:31:54,813 INFO L443 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-11-15 21:31:54,813 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-11-15 21:31:54,813 INFO L443 ceAbstractionStarter]: For program point L317-3(lines 317 321) no Hoare annotation was computed. [2019-11-15 21:31:54,813 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-11-15 21:31:54,813 INFO L443 ceAbstractionStarter]: For program point L317-6(lines 317 321) no Hoare annotation was computed. [2019-11-15 21:31:54,815 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-11-15 21:31:54,816 INFO L443 ceAbstractionStarter]: For program point L317-9(lines 317 321) no Hoare annotation was computed. [2019-11-15 21:31:54,816 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-11-15 21:31:54,816 INFO L443 ceAbstractionStarter]: For program point L317-12(lines 317 321) no Hoare annotation was computed. [2019-11-15 21:31:54,816 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-11-15 21:31:54,817 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-11-15 21:31:54,817 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-11-15 21:31:54,817 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-11-15 21:31:54,818 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-11-15 21:31:54,818 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 21:31:54,818 INFO L443 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-11-15 21:31:54,818 INFO L443 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-11-15 21:31:54,818 INFO L443 ceAbstractionStarter]: For program point L287-3(lines 276 299) no Hoare annotation was computed. [2019-11-15 21:31:54,818 INFO L443 ceAbstractionStarter]: For program point L254-3(lines 248 271) no Hoare annotation was computed. [2019-11-15 21:31:54,819 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-11-15 21:31:54,819 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 21:31:54,819 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-11-15 21:31:54,819 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:31:54,819 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-11-15 21:31:54,820 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-11-15 21:31:54,820 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-11-15 21:31:54,821 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-11-15 21:31:54,821 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-11-15 21:31:54,821 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-11-15 21:31:54,822 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-11-15 21:31:54,822 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-11-15 21:31:54,822 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-11-15 21:31:54,823 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-11-15 21:31:54,823 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-11-15 21:31:54,823 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-11-15 21:31:54,823 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-11-15 21:31:54,824 INFO L439 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-15 21:31:54,824 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-11-15 21:31:54,824 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-11-15 21:31:54,824 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-11-15 21:31:54,825 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-11-15 21:31:54,825 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-11-15 21:31:54,825 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-11-15 21:31:54,826 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-11-15 21:31:54,826 INFO L443 ceAbstractionStarter]: For program point L259-3(lines 248 271) no Hoare annotation was computed. [2019-11-15 21:31:54,826 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-11-15 21:31:54,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:31:54,826 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-11-15 21:31:54,826 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-11-15 21:31:54,827 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-11-15 21:31:54,827 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:31:54,827 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-11-15 21:31:54,827 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-11-15 21:31:54,828 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-11-15 21:31:54,828 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,828 INFO L443 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,828 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-15 21:31:54,828 INFO L443 ceAbstractionStarter]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,828 INFO L443 ceAbstractionStarter]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,828 INFO L443 ceAbstractionStarter]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-11-15 21:31:54,829 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-11-15 21:31:54,830 INFO L443 ceAbstractionStarter]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-11-15 21:31:54,830 INFO L443 ceAbstractionStarter]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-11-15 21:31:54,830 INFO L443 ceAbstractionStarter]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-11-15 21:31:54,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:31:54 BoogieIcfgContainer [2019-11-15 21:31:54,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:31:54,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:31:54,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:31:54,911 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:31:54,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:31:42" (3/4) ... [2019-11-15 21:31:54,915 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:31:54,929 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 21:31:54,930 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:31:54,957 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-11-15 21:31:54,957 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-11-15 21:31:54,958 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-11-15 21:31:54,958 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-11-15 21:31:54,958 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-11-15 21:31:54,958 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-11-15 21:31:54,959 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-11-15 21:31:54,959 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-11-15 21:31:54,959 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-11-15 21:31:54,959 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-11-15 21:31:54,960 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-11-15 21:31:54,960 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-11-15 21:31:54,960 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-11-15 21:31:54,961 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-11-15 21:31:54,961 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-11-15 21:31:54,961 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-11-15 21:31:54,961 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-11-15 21:31:54,962 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-11-15 21:31:54,962 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-11-15 21:31:54,962 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-11-15 21:31:54,962 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-11-15 21:31:54,963 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-11-15 21:31:54,963 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-11-15 21:31:54,963 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-11-15 21:31:54,963 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-11-15 21:31:54,964 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-11-15 21:31:54,964 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-11-15 21:31:54,964 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-11-15 21:31:54,965 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-11-15 21:31:54,965 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-11-15 21:31:54,965 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-11-15 21:31:54,965 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-11-15 21:31:54,965 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-11-15 21:31:54,966 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-11-15 21:31:54,966 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-11-15 21:31:54,966 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-11-15 21:31:54,966 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-11-15 21:31:54,967 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-11-15 21:31:54,967 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-11-15 21:31:54,967 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-11-15 21:31:54,967 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-11-15 21:31:54,968 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-11-15 21:31:54,968 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-11-15 21:31:54,968 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-11-15 21:31:55,031 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b4d077cf-a855-4a79-9a2e-14790aeef451/bin/uautomizer/witness.graphml [2019-11-15 21:31:55,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:31:55,033 INFO L168 Benchmark]: Toolchain (without parser) took 13468.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 427.8 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -359.4 MB). Peak memory consumption was 68.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:55,033 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:31:55,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:55,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:55,034 INFO L168 Benchmark]: Boogie Preprocessor took 34.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:31:55,034 INFO L168 Benchmark]: RCFGBuilder took 714.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:55,035 INFO L168 Benchmark]: TraceAbstraction took 12201.47 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 313.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -271.3 MB). Peak memory consumption was 584.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:55,035 INFO L168 Benchmark]: Witness Printer took 120.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:31:55,038 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 714.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12201.47 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 313.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -271.3 MB). Peak memory consumption was 584.4 MB. Max. memory is 11.5 GB. * Witness Printer took 120.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 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: 12.0s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, HoareTripleCheckerStatistics: 3044 SDtfs, 2703 SDslu, 1946 SDs, 0 SdLazy, 243 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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, 0.9s HoareSimplificationTime, 52 FomulaSimplificationsInter, 628 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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...