./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.25-f470102 [2019-11-28 17:31:23,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:31:23,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:31:23,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:31:23,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:31:23,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:31:23,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:31:23,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:31:23,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:31:23,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:31:23,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:31:23,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:31:23,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:31:23,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:31:23,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:31:23,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:31:23,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:31:23,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:31:23,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:31:23,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:31:23,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:31:23,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:31:23,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:31:23,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:31:23,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:31:23,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:31:23,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:31:23,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:31:23,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:31:23,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:31:23,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:31:23,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:31:23,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:31:23,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:31:23,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:31:23,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:31:23,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:31:23,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:31:23,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:31:23,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:31:23,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:31:23,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:31:23,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:31:23,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:31:23,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:31:23,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:31:23,787 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:31:23,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:31:23,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:31:23,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:31:23,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:31:23,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:31:23,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:31:23,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:31:23,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:31:23,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:31:23,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:31:23,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:31:23,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:31:23,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:31:23,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:31:23,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:31:23,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:31:23,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:31:23,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:31:23,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:31:23,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:31:23,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:31:23,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:31:23,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:31:23,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:31:23,798 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-28 17:31:24,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:31:24,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:31:24,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:31:24,170 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:31:24,171 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:31:24,171 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-11-28 17:31:24,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617f34c57/6679cc2815d54a15aa4611223fa8f69c/FLAG1c4ef4784 [2019-11-28 17:31:24,688 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:31:24,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-11-28 17:31:24,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617f34c57/6679cc2815d54a15aa4611223fa8f69c/FLAG1c4ef4784 [2019-11-28 17:31:25,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617f34c57/6679cc2815d54a15aa4611223fa8f69c [2019-11-28 17:31:25,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:31:25,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:31:25,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:31:25,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:31:25,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:31:25,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a4f693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25, skipping insertion in model container [2019-11-28 17:31:25,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:31:25,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:31:25,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:31:25,344 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:31:25,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:31:25,459 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:31:25,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25 WrapperNode [2019-11-28 17:31:25,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:31:25,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:31:25,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:31:25,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:31:25,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:31:25,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:31:25,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:31:25,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:31:25,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... [2019-11-28 17:31:25,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:31:25,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:31:25,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:31:25,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:31:25,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:31:25,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:31:25,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:31:26,259 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:31:26,260 INFO L287 CfgBuilder]: Removed 80 assume(true) statements. [2019-11-28 17:31:26,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:26 BoogieIcfgContainer [2019-11-28 17:31:26,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:31:26,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:31:26,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:31:26,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:31:26,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:31:25" (1/3) ... [2019-11-28 17:31:26,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bebfcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:31:26, skipping insertion in model container [2019-11-28 17:31:26,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:25" (2/3) ... [2019-11-28 17:31:26,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bebfcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:31:26, skipping insertion in model container [2019-11-28 17:31:26,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:26" (3/3) ... [2019-11-28 17:31:26,269 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-11-28 17:31:26,279 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:31:26,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:31:26,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:31:26,324 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:31:26,324 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:31:26,325 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:31:26,325 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:31:26,325 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:31:26,325 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:31:26,326 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:31:26,326 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:31:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-28 17:31:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:26,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:26,353 INFO L410 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-28 17:31:26,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-28 17:31:26,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:26,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116386162] [2019-11-28 17:31:26,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:26,496 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-28 17:31:26,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116386162] [2019-11-28 17:31:26,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:26,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:26,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490361557] [2019-11-28 17:31:26,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:26,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:26,522 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-11-28 17:31:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:26,580 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2019-11-28 17:31:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:26,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:26,605 INFO L225 Difference]: With dead ends: 277 [2019-11-28 17:31:26,606 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 17:31:26,615 INFO L630 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-28 17:31:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 17:31:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-28 17:31:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-28 17:31:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-11-28 17:31:26,669 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2019-11-28 17:31:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:26,669 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-11-28 17:31:26,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-11-28 17:31:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:26,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:26,671 INFO L410 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-28 17:31:26,672 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:26,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-28 17:31:26,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:26,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092558899] [2019-11-28 17:31:26,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:26,728 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-28 17:31:26,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092558899] [2019-11-28 17:31:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:26,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:26,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234580075] [2019-11-28 17:31:26,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:26,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:26,732 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2019-11-28 17:31:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:26,817 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2019-11-28 17:31:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:26,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:26,821 INFO L225 Difference]: With dead ends: 363 [2019-11-28 17:31:26,821 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 17:31:26,823 INFO L630 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-28 17:31:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 17:31:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-11-28 17:31:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-28 17:31:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-11-28 17:31:26,855 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2019-11-28 17:31:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:26,855 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-11-28 17:31:26,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-11-28 17:31:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:26,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:26,858 INFO L410 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-28 17:31:26,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-28 17:31:26,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:26,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853893468] [2019-11-28 17:31:26,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:26,902 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-28 17:31:26,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853893468] [2019-11-28 17:31:26,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:26,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:26,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156662699] [2019-11-28 17:31:26,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:26,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:26,908 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-11-28 17:31:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:26,968 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2019-11-28 17:31:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:26,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:26,974 INFO L225 Difference]: With dead ends: 453 [2019-11-28 17:31:26,975 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 17:31:26,976 INFO L630 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-28 17:31:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 17:31:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-28 17:31:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-28 17:31:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2019-11-28 17:31:27,002 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2019-11-28 17:31:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:27,003 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2019-11-28 17:31:27,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2019-11-28 17:31:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:27,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,005 INFO L410 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-28 17:31:27,005 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-28 17:31:27,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144808805] [2019-11-28 17:31:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:27,050 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-28 17:31:27,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144808805] [2019-11-28 17:31:27,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:27,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:27,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406488369] [2019-11-28 17:31:27,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:27,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:27,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:27,054 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand 3 states. [2019-11-28 17:31:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:27,109 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2019-11-28 17:31:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:27,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:27,111 INFO L225 Difference]: With dead ends: 452 [2019-11-28 17:31:27,112 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 17:31:27,113 INFO L630 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-28 17:31:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 17:31:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-28 17:31:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-28 17:31:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2019-11-28 17:31:27,135 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2019-11-28 17:31:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:27,135 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2019-11-28 17:31:27,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2019-11-28 17:31:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:27,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,137 INFO L410 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-28 17:31:27,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-28 17:31:27,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445343966] [2019-11-28 17:31:27,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:27,179 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-28 17:31:27,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445343966] [2019-11-28 17:31:27,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:27,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:27,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927323644] [2019-11-28 17:31:27,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:27,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:27,183 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 3 states. [2019-11-28 17:31:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:27,232 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2019-11-28 17:31:27,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:27,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:27,234 INFO L225 Difference]: With dead ends: 451 [2019-11-28 17:31:27,234 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 17:31:27,235 INFO L630 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-28 17:31:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 17:31:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-28 17:31:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-28 17:31:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 305 transitions. [2019-11-28 17:31:27,253 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 305 transitions. Word has length 39 [2019-11-28 17:31:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:27,254 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 305 transitions. [2019-11-28 17:31:27,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2019-11-28 17:31:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:31:27,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,256 INFO L410 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-28 17:31:27,256 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-28 17:31:27,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311039710] [2019-11-28 17:31:27,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:27,312 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-28 17:31:27,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311039710] [2019-11-28 17:31:27,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:27,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:27,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613167026] [2019-11-28 17:31:27,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:27,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:27,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:27,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:27,315 INFO L87 Difference]: Start difference. First operand 230 states and 305 transitions. Second operand 3 states. [2019-11-28 17:31:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:27,399 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2019-11-28 17:31:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:27,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 17:31:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:27,404 INFO L225 Difference]: With dead ends: 638 [2019-11-28 17:31:27,404 INFO L226 Difference]: Without dead ends: 419 [2019-11-28 17:31:27,405 INFO L630 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-28 17:31:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-11-28 17:31:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2019-11-28 17:31:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-28 17:31:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 517 transitions. [2019-11-28 17:31:27,433 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 517 transitions. Word has length 39 [2019-11-28 17:31:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:27,434 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 517 transitions. [2019-11-28 17:31:27,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 517 transitions. [2019-11-28 17:31:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:31:27,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,444 INFO L410 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-28 17:31:27,444 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1499945056, now seen corresponding path program 1 times [2019-11-28 17:31:27,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514230645] [2019-11-28 17:31:27,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:27,578 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-28 17:31:27,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514230645] [2019-11-28 17:31:27,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:27,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:27,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911738421] [2019-11-28 17:31:27,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:27,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:27,591 INFO L87 Difference]: Start difference. First operand 395 states and 517 transitions. Second operand 3 states. [2019-11-28 17:31:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:27,669 INFO L93 Difference]: Finished difference Result 1095 states and 1440 transitions. [2019-11-28 17:31:27,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:27,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-28 17:31:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:27,674 INFO L225 Difference]: With dead ends: 1095 [2019-11-28 17:31:27,675 INFO L226 Difference]: Without dead ends: 717 [2019-11-28 17:31:27,676 INFO L630 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-28 17:31:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-28 17:31:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 687. [2019-11-28 17:31:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-11-28 17:31:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 897 transitions. [2019-11-28 17:31:27,717 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 897 transitions. Word has length 63 [2019-11-28 17:31:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:27,719 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 897 transitions. [2019-11-28 17:31:27,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 897 transitions. [2019-11-28 17:31:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:31:27,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,721 INFO L410 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-28 17:31:27,721 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1803857567, now seen corresponding path program 1 times [2019-11-28 17:31:27,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679101257] [2019-11-28 17:31:27,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:27,804 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-28 17:31:27,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679101257] [2019-11-28 17:31:27,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:27,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:27,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100939251] [2019-11-28 17:31:27,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:27,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:27,808 INFO L87 Difference]: Start difference. First operand 687 states and 897 transitions. Second operand 3 states. [2019-11-28 17:31:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:27,911 INFO L93 Difference]: Finished difference Result 1933 states and 2521 transitions. [2019-11-28 17:31:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:27,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-28 17:31:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:27,919 INFO L225 Difference]: With dead ends: 1933 [2019-11-28 17:31:27,920 INFO L226 Difference]: Without dead ends: 1271 [2019-11-28 17:31:27,921 INFO L630 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-28 17:31:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-11-28 17:31:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1257. [2019-11-28 17:31:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-11-28 17:31:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1607 transitions. [2019-11-28 17:31:27,990 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1607 transitions. Word has length 63 [2019-11-28 17:31:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:27,990 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 1607 transitions. [2019-11-28 17:31:27,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1607 transitions. [2019-11-28 17:31:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 17:31:27,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:27,993 INFO L410 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-28 17:31:27,993 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash -45669778, now seen corresponding path program 1 times [2019-11-28 17:31:27,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:27,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219621172] [2019-11-28 17:31:27,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,057 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-28 17:31:28,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219621172] [2019-11-28 17:31:28,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:28,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702927361] [2019-11-28 17:31:28,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,061 INFO L87 Difference]: Start difference. First operand 1257 states and 1607 transitions. Second operand 3 states. [2019-11-28 17:31:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,224 INFO L93 Difference]: Finished difference Result 3544 states and 4519 transitions. [2019-11-28 17:31:28,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-28 17:31:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,236 INFO L225 Difference]: With dead ends: 3544 [2019-11-28 17:31:28,236 INFO L226 Difference]: Without dead ends: 2312 [2019-11-28 17:31:28,238 INFO L630 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-28 17:31:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-11-28 17:31:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2019-11-28 17:31:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-28 17:31:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2876 transitions. [2019-11-28 17:31:28,347 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2876 transitions. Word has length 64 [2019-11-28 17:31:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,348 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2876 transitions. [2019-11-28 17:31:28,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2876 transitions. [2019-11-28 17:31:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 17:31:28,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,352 INFO L410 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-28 17:31:28,352 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,352 INFO L82 PathProgramCache]: Analyzing trace with hash 460727628, now seen corresponding path program 1 times [2019-11-28 17:31:28,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412605765] [2019-11-28 17:31:28,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,422 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-28 17:31:28,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412605765] [2019-11-28 17:31:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:28,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075228938] [2019-11-28 17:31:28,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,425 INFO L87 Difference]: Start difference. First operand 2312 states and 2876 transitions. Second operand 3 states. [2019-11-28 17:31:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,554 INFO L93 Difference]: Finished difference Result 4080 states and 5097 transitions. [2019-11-28 17:31:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-28 17:31:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,568 INFO L225 Difference]: With dead ends: 4080 [2019-11-28 17:31:28,569 INFO L226 Difference]: Without dead ends: 2324 [2019-11-28 17:31:28,572 INFO L630 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-28 17:31:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-11-28 17:31:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2264. [2019-11-28 17:31:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-28 17:31:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2740 transitions. [2019-11-28 17:31:28,667 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2740 transitions. Word has length 93 [2019-11-28 17:31:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,671 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2740 transitions. [2019-11-28 17:31:28,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2740 transitions. [2019-11-28 17:31:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 17:31:28,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,675 INFO L410 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-28 17:31:28,675 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -491999912, now seen corresponding path program 1 times [2019-11-28 17:31:28,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279214332] [2019-11-28 17:31:28,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:28,722 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-28 17:31:28,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279214332] [2019-11-28 17:31:28,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:28,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:28,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66958276] [2019-11-28 17:31:28,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:28,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:28,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:28,725 INFO L87 Difference]: Start difference. First operand 2264 states and 2740 transitions. Second operand 3 states. [2019-11-28 17:31:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:28,844 INFO L93 Difference]: Finished difference Result 4484 states and 5430 transitions. [2019-11-28 17:31:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:28,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 17:31:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:28,855 INFO L225 Difference]: With dead ends: 4484 [2019-11-28 17:31:28,856 INFO L226 Difference]: Without dead ends: 2266 [2019-11-28 17:31:28,859 INFO L630 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-28 17:31:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-11-28 17:31:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-11-28 17:31:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-28 17:31:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2700 transitions. [2019-11-28 17:31:28,950 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2700 transitions. Word has length 94 [2019-11-28 17:31:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:28,950 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2700 transitions. [2019-11-28 17:31:28,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2700 transitions. [2019-11-28 17:31:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 17:31:28,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:28,954 INFO L410 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-28 17:31:28,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2077878383, now seen corresponding path program 1 times [2019-11-28 17:31:28,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:28,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907374463] [2019-11-28 17:31:28,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,028 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-28 17:31:29,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907374463] [2019-11-28 17:31:29,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:29,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436323133] [2019-11-28 17:31:29,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:29,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:29,032 INFO L87 Difference]: Start difference. First operand 2264 states and 2700 transitions. Second operand 5 states. [2019-11-28 17:31:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,276 INFO L93 Difference]: Finished difference Result 4182 states and 5007 transitions. [2019-11-28 17:31:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:29,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-28 17:31:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,287 INFO L225 Difference]: With dead ends: 4182 [2019-11-28 17:31:29,287 INFO L226 Difference]: Without dead ends: 1933 [2019-11-28 17:31:29,292 INFO L630 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-28 17:31:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-11-28 17:31:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1745. [2019-11-28 17:31:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-11-28 17:31:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2049 transitions. [2019-11-28 17:31:29,423 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2049 transitions. Word has length 94 [2019-11-28 17:31:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:29,423 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 2049 transitions. [2019-11-28 17:31:29,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2049 transitions. [2019-11-28 17:31:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 17:31:29,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:29,426 INFO L410 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-28 17:31:29,427 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash -267062732, now seen corresponding path program 1 times [2019-11-28 17:31:29,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:29,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978516464] [2019-11-28 17:31:29,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,538 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-28 17:31:29,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978516464] [2019-11-28 17:31:29,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:29,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275983588] [2019-11-28 17:31:29,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:29,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:29,541 INFO L87 Difference]: Start difference. First operand 1745 states and 2049 transitions. Second operand 3 states. [2019-11-28 17:31:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,661 INFO L93 Difference]: Finished difference Result 2952 states and 3474 transitions. [2019-11-28 17:31:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:29,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 17:31:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,669 INFO L225 Difference]: With dead ends: 2952 [2019-11-28 17:31:29,669 INFO L226 Difference]: Without dead ends: 1232 [2019-11-28 17:31:29,672 INFO L630 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-28 17:31:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-28 17:31:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1224. [2019-11-28 17:31:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-28 17:31:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1403 transitions. [2019-11-28 17:31:29,747 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1403 transitions. Word has length 94 [2019-11-28 17:31:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:29,748 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1403 transitions. [2019-11-28 17:31:29,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1403 transitions. [2019-11-28 17:31:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:31:29,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:29,750 INFO L410 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-28 17:31:29,751 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1230973766, now seen corresponding path program 1 times [2019-11-28 17:31:29,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:29,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287765604] [2019-11-28 17:31:29,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:29,813 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-28 17:31:29,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287765604] [2019-11-28 17:31:29,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:29,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:29,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179021304] [2019-11-28 17:31:29,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:29,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:29,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:29,817 INFO L87 Difference]: Start difference. First operand 1224 states and 1403 transitions. Second operand 5 states. [2019-11-28 17:31:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:29,964 INFO L93 Difference]: Finished difference Result 2222 states and 2544 transitions. [2019-11-28 17:31:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:29,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-28 17:31:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:29,968 INFO L225 Difference]: With dead ends: 2222 [2019-11-28 17:31:29,968 INFO L226 Difference]: Without dead ends: 648 [2019-11-28 17:31:29,971 INFO L630 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-28 17:31:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-28 17:31:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 582. [2019-11-28 17:31:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-28 17:31:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2019-11-28 17:31:30,006 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 95 [2019-11-28 17:31:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:30,007 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2019-11-28 17:31:30,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2019-11-28 17:31:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 17:31:30,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:30,008 INFO L410 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-28 17:31:30,009 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2019-11-28 17:31:30,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:30,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855998497] [2019-11-28 17:31:30,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:30,112 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-28 17:31:30,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855998497] [2019-11-28 17:31:30,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:30,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:31:30,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225605789] [2019-11-28 17:31:30,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:31:30,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:31:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:31:30,114 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2019-11-28 17:31:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:30,170 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2019-11-28 17:31:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:31:30,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 17:31:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:30,172 INFO L225 Difference]: With dead ends: 586 [2019-11-28 17:31:30,172 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:31:30,175 INFO L630 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-28 17:31:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:31:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:31:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:31:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:31:30,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-28 17:31:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:30,177 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:31:30,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:31:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:31:30,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:31:30,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:31:31,686 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:32,003 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:32,285 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:32,519 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:32,758 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:32,977 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:33,166 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 17:31:33,369 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:33,860 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:34,082 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:34,278 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 17:31:34,594 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:34,805 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:34,936 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-11-28 17:31:35,134 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 17:31:35,400 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 17:31:35,720 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:35,934 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:36,298 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:36,534 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:36,757 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:36,990 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:37,195 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 17:31:37,417 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 17:31:37,658 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-28 17:31:37,915 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:38,211 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 17:31:38,416 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-28 17:31:38,549 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-28 17:31:38,754 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-11-28 17:31:38,973 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 17:31:39,263 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 17:31:39,269 INFO L242 CegarLoopResult]: 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-28 17:31:39,269 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-28 17:31:39,270 INFO L242 CegarLoopResult]: 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-28 17:31:39,270 INFO L246 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-28 17:31:39,270 INFO L242 CegarLoopResult]: 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-28 17:31:39,271 INFO L246 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-11-28 17:31:39,271 INFO L246 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-11-28 17:31:39,271 INFO L246 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-11-28 17:31:39,271 INFO L242 CegarLoopResult]: 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-28 17:31:39,272 INFO L242 CegarLoopResult]: 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-28 17:31:39,272 INFO L242 CegarLoopResult]: At program point L471(lines 462 473) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-28 17:31:39,272 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-28 17:31:39,272 INFO L246 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,273 INFO L246 CegarLoopResult]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,273 INFO L246 CegarLoopResult]: For program point L309-3(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,273 INFO L242 CegarLoopResult]: 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-28 17:31:39,273 INFO L242 CegarLoopResult]: 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-28 17:31:39,274 INFO L246 CegarLoopResult]: For program point L309-5(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,274 INFO L242 CegarLoopResult]: At program point L144-1(lines 132 146) the Hoare annotation is: (let ((.cse7 (<= 2 ~t1_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ~t1_i~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse7 .cse8 (<= ~local~0 ~token~0)) (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse6 .cse5 (= 0 ~t1_st~0) .cse8))) [2019-11-28 17:31:39,274 INFO L246 CegarLoopResult]: For program point L309-6(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,274 INFO L246 CegarLoopResult]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-11-28 17:31:39,275 INFO L242 CegarLoopResult]: 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-28 17:31:39,275 INFO L246 CegarLoopResult]: For program point L309-8(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,275 INFO L242 CegarLoopResult]: 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-28 17:31:39,275 INFO L246 CegarLoopResult]: For program point L309-9(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,276 INFO L242 CegarLoopResult]: 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-28 17:31:39,276 INFO L246 CegarLoopResult]: For program point L309-11(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,276 INFO L246 CegarLoopResult]: For program point L309-12(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,276 INFO L246 CegarLoopResult]: For program point L309-14(lines 309 313) no Hoare annotation was computed. [2019-11-28 17:31:39,277 INFO L242 CegarLoopResult]: 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-28 17:31:39,277 INFO L246 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-11-28 17:31:39,277 INFO L246 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-11-28 17:31:39,277 INFO L246 CegarLoopResult]: For program point L277-3(lines 276 299) no Hoare annotation was computed. [2019-11-28 17:31:39,277 INFO L242 CegarLoopResult]: 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-28 17:31:39,278 INFO L246 CegarLoopResult]: For program point L178-1(lines 178 188) no Hoare annotation was computed. [2019-11-28 17:31:39,278 INFO L242 CegarLoopResult]: At program point L145-1(lines 129 147) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ~t1_i~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse6 .cse7) (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse8 .cse5 .cse9 (= 0 ~t1_st~0) .cse7))) [2019-11-28 17:31:39,278 INFO L246 CegarLoopResult]: For program point L178-2(lines 178 188) no Hoare annotation was computed. [2019-11-28 17:31:39,278 INFO L242 CegarLoopResult]: 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-28 17:31:39,278 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-28 17:31:39,279 INFO L242 CegarLoopResult]: 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-28 17:31:39,279 INFO L242 CegarLoopResult]: 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-28 17:31:39,279 INFO L246 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,280 INFO L246 CegarLoopResult]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,281 INFO L246 CegarLoopResult]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,281 INFO L246 CegarLoopResult]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,281 INFO L246 CegarLoopResult]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,281 INFO L246 CegarLoopResult]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-11-28 17:31:39,281 INFO L246 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-11-28 17:31:39,281 INFO L246 CegarLoopResult]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-11-28 17:31:39,282 INFO L242 CegarLoopResult]: 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-28 17:31:39,282 INFO L246 CegarLoopResult]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-11-28 17:31:39,282 INFO L246 CegarLoopResult]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-11-28 17:31:39,282 INFO L246 CegarLoopResult]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-11-28 17:31:39,282 INFO L246 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-11-28 17:31:39,283 INFO L246 CegarLoopResult]: For program point L182-1(lines 182 187) no Hoare annotation was computed. [2019-11-28 17:31:39,283 INFO L246 CegarLoopResult]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2019-11-28 17:31:39,283 INFO L242 CegarLoopResult]: 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-28 17:31:39,283 INFO L246 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-11-28 17:31:39,283 INFO L246 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-11-28 17:31:39,283 INFO L246 CegarLoopResult]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-11-28 17:31:39,284 INFO L246 CegarLoopResult]: For program point L282-3(lines 276 299) no Hoare annotation was computed. [2019-11-28 17:31:39,284 INFO L246 CegarLoopResult]: For program point L249-4(lines 248 271) no Hoare annotation was computed. [2019-11-28 17:31:39,284 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:31:39,284 INFO L246 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-11-28 17:31:39,284 INFO L246 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-11-28 17:31:39,285 INFO L242 CegarLoopResult]: 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-28 17:31:39,285 INFO L246 CegarLoopResult]: For program point L317-3(lines 317 321) no Hoare annotation was computed. [2019-11-28 17:31:39,285 INFO L242 CegarLoopResult]: 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|)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (= ~t1_i~0 1)) (.cse8 (= 0 ~t1_st~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse7) (and .cse0 .cse1 (not .cse2) .cse3 .cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse8 .cse6 (<= ~local~0 ~token~0)))) [2019-11-28 17:31:39,285 INFO L246 CegarLoopResult]: For program point L317-6(lines 317 321) no Hoare annotation was computed. [2019-11-28 17:31:39,285 INFO L242 CegarLoopResult]: 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-28 17:31:39,286 INFO L246 CegarLoopResult]: For program point L317-9(lines 317 321) no Hoare annotation was computed. [2019-11-28 17:31:39,286 INFO L242 CegarLoopResult]: 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-28 17:31:39,286 INFO L246 CegarLoopResult]: For program point L317-12(lines 317 321) no Hoare annotation was computed. [2019-11-28 17:31:39,287 INFO L242 CegarLoopResult]: 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-28 17:31:39,287 INFO L246 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-11-28 17:31:39,287 INFO L242 CegarLoopResult]: 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-28 17:31:39,287 INFO L242 CegarLoopResult]: 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-28 17:31:39,288 INFO L242 CegarLoopResult]: 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-28 17:31:39,288 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 17:31:39,288 INFO L246 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-11-28 17:31:39,288 INFO L246 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-11-28 17:31:39,288 INFO L246 CegarLoopResult]: For program point L287-3(lines 276 299) no Hoare annotation was computed. [2019-11-28 17:31:39,289 INFO L246 CegarLoopResult]: For program point L254-3(lines 248 271) no Hoare annotation was computed. [2019-11-28 17:31:39,289 INFO L242 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (= ~m_pc~0 0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse10 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0))) (or (and .cse0 (= 1 ~t1_pc~0) (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse10 .cse3 .cse7 .cse0 .cse1 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse11 (<= ~local~0 ~token~0)) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse12 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse4 .cse3 .cse5 .cse6 .cse7))) [2019-11-28 17:31:39,289 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-28 17:31:39,289 INFO L246 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-11-28 17:31:39,289 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:31:39,290 INFO L242 CegarLoopResult]: 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-28 17:31:39,290 INFO L242 CegarLoopResult]: 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-28 17:31:39,291 INFO L242 CegarLoopResult]: 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-28 17:31:39,291 INFO L242 CegarLoopResult]: 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-28 17:31:39,291 INFO L242 CegarLoopResult]: 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-28 17:31:39,292 INFO L242 CegarLoopResult]: 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-28 17:31:39,292 INFO L242 CegarLoopResult]: 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-28 17:31:39,292 INFO L242 CegarLoopResult]: 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-28 17:31:39,293 INFO L242 CegarLoopResult]: 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-28 17:31:39,293 INFO L242 CegarLoopResult]: 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-28 17:31:39,293 INFO L242 CegarLoopResult]: 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-28 17:31:39,294 INFO L242 CegarLoopResult]: 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-28 17:31:39,294 INFO L242 CegarLoopResult]: 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-28 17:31:39,294 INFO L242 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-28 17:31:39,294 INFO L242 CegarLoopResult]: 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-28 17:31:39,295 INFO L242 CegarLoopResult]: 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-28 17:31:39,295 INFO L242 CegarLoopResult]: 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-28 17:31:39,295 INFO L242 CegarLoopResult]: At program point L126-3(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse1 (not .cse14)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.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 .cse14 .cse7 .cse8 .cse16 .cse4 .cse5 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse7 .cse16 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12) (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-28 17:31:39,296 INFO L242 CegarLoopResult]: 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-28 17:31:39,296 INFO L246 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-11-28 17:31:39,296 INFO L242 CegarLoopResult]: 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-28 17:31:39,296 INFO L246 CegarLoopResult]: For program point L259-3(lines 248 271) no Hoare annotation was computed. [2019-11-28 17:31:39,297 INFO L246 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-11-28 17:31:39,297 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:31:39,297 INFO L246 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-11-28 17:31:39,297 INFO L246 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-11-28 17:31:39,297 INFO L246 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-11-28 17:31:39,297 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 17:31:39,298 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-28 17:31:39,298 INFO L242 CegarLoopResult]: 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-28 17:31:39,298 INFO L242 CegarLoopResult]: 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-28 17:31:39,299 INFO L242 CegarLoopResult]: 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-28 17:31:39,299 INFO L246 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,299 INFO L246 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,299 INFO L246 CegarLoopResult]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-28 17:31:39,299 INFO L246 CegarLoopResult]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,300 INFO L246 CegarLoopResult]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,300 INFO L246 CegarLoopResult]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,300 INFO L246 CegarLoopResult]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,300 INFO L246 CegarLoopResult]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,300 INFO L246 CegarLoopResult]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,300 INFO L246 CegarLoopResult]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,301 INFO L246 CegarLoopResult]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-11-28 17:31:39,301 INFO L246 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-11-28 17:31:39,301 INFO L246 CegarLoopResult]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-11-28 17:31:39,301 INFO L246 CegarLoopResult]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-11-28 17:31:39,301 INFO L246 CegarLoopResult]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-11-28 17:31:39,301 INFO L246 CegarLoopResult]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-11-28 17:31:39,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:31:39 BoogieIcfgContainer [2019-11-28 17:31:39,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:31:39,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:31:39,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:31:39,401 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:31:39,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:26" (3/4) ... [2019-11-28 17:31:39,405 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:31:39,422 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:31:39,423 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:31:39,458 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-28 17:31:39,459 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-28 17:31:39,459 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-28 17:31:39,460 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-28 17:31:39,460 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-28 17:31:39,461 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-28 17:31:39,461 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-28 17:31:39,462 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-28 17:31:39,462 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-28 17:31:39,463 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-28 17:31:39,463 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-28 17:31:39,465 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-28 17:31:39,465 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-28 17:31:39,465 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) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 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)) || ((((((((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-28 17:31:39,466 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-28 17:31:39,466 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((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 <= E_1) && tmp___0 == 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)) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) [2019-11-28 17:31:39,466 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-28 17:31:39,467 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-28 17:31:39,467 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-28 17:31:39,468 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-28 17:31:39,468 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-28 17:31:39,469 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-28 17:31:39,469 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-28 17:31:39,469 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-28 17:31:39,470 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-28 17:31:39,474 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-28 17:31:39,474 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-28 17:31:39,474 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-28 17:31:39,476 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-28 17:31:39,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && __retres1 == 0) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 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-28 17:31:39,477 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-28 17:31:39,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 2 <= t1_st) && __retres1 == 0) && local <= token) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && __retres1 == 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) [2019-11-28 17:31:39,477 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-28 17:31:39,479 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-28 17:31:39,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && t1_i == 1) && 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-28 17:31:39,479 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-28 17:31:39,480 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-28 17:31:39,480 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-28 17:31:39,480 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-28 17:31:39,481 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-28 17:31:39,481 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-28 17:31:39,481 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-28 17:31:39,482 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-28 17:31:39,484 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-28 17:31:39,595 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:31:39,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:31:39,597 INFO L168 Benchmark]: Toolchain (without parser) took 14533.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 276.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:39,597 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:39,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:39,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:39,599 INFO L168 Benchmark]: Boogie Preprocessor took 41.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:39,599 INFO L168 Benchmark]: RCFGBuilder took 701.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:39,599 INFO L168 Benchmark]: TraceAbstraction took 13137.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.2 MB). Peak memory consumption was 515.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:39,602 INFO L168 Benchmark]: Witness Printer took 195.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:39,606 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 701.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13137.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.2 MB). Peak memory consumption was 515.4 MB. Max. memory is 11.5 GB. * Witness Printer took 195.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 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 && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && __retres1 == 0) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 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) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 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)) || ((((((((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: ((((((((((((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 <= E_1) && tmp___0 == 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)) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) - 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 && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 2 <= t1_st) && __retres1 == 0) && local <= token) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && __retres1 == 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) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && t1_i == 1) && 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: 3.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, 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, 10234 HoareAnnotationTreeSize, 52 FomulaSimplifications, 19297 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 635 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 126390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 203/203 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...