/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:58,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:58,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:58,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:58,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:58,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:58,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:58,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:58,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:58,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:58,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:58,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:58,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:58,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:58,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:58,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:58,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:58,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:58,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:58,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:58,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:58,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:58,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:59,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:59,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:59,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:59,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:59,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:59,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:59,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:59,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:59,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:59,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:59,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:59,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:59,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:59,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:59,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:59,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:59,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:59,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:59,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:48:59,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:59,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:59,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:59,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:59,029 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:59,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:59,030 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:59,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:59,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:59,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:59,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:59,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:59,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:59,031 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:59,031 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:59,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:59,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:59,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:59,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:59,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:59,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:59,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:59,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:59,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:59,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:59,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:59,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:59,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:59,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:59,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:59,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:59,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:59,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:59,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:59,320 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:59,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-11-23 22:48:59,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045dd7a4b/ae0c1c727b5042e7906b9aa8fb3354e2/FLAG5c40a219a [2019-11-23 22:48:59,851 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:59,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-11-23 22:48:59,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045dd7a4b/ae0c1c727b5042e7906b9aa8fb3354e2/FLAG5c40a219a [2019-11-23 22:49:00,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045dd7a4b/ae0c1c727b5042e7906b9aa8fb3354e2 [2019-11-23 22:49:00,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:49:00,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:49:00,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:00,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:49:00,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:49:00,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f15230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00, skipping insertion in model container [2019-11-23 22:49:00,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:49:00,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:49:00,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:00,529 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:49:00,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:00,670 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:49:00,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00 WrapperNode [2019-11-23 22:49:00,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:00,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:00,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:49:00,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:49:00,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:00,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:49:00,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:49:00,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:49:00,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (1/1) ... [2019-11-23 22:49:00,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:49:00,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:49:00,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:49:00,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:49:00,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (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-23 22:49:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:49:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:49:01,493 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:49:01,493 INFO L284 CfgBuilder]: Removed 80 assume(true) statements. [2019-11-23 22:49:01,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:01 BoogieIcfgContainer [2019-11-23 22:49:01,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:49:01,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:49:01,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:49:01,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:49:01,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:49:00" (1/3) ... [2019-11-23 22:49:01,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cfb4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:01, skipping insertion in model container [2019-11-23 22:49:01,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:00" (2/3) ... [2019-11-23 22:49:01,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cfb4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:01, skipping insertion in model container [2019-11-23 22:49:01,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:01" (3/3) ... [2019-11-23 22:49:01,503 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-11-23 22:49:01,513 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:49:01,522 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:49:01,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:49:01,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:49:01,564 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:49:01,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:49:01,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:49:01,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:49:01,566 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:49:01,566 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:49:01,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:49:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-23 22:49:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:49:01,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:01,593 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-23 22:49:01,593 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-23 22:49:01,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:01,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854191766] [2019-11-23 22:49:01,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:01,750 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-23 22:49:01,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854191766] [2019-11-23 22:49:01,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:01,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:01,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332126170] [2019-11-23 22:49:01,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:01,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:01,776 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-11-23 22:49:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:01,827 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2019-11-23 22:49:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:01,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:49:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:01,843 INFO L225 Difference]: With dead ends: 277 [2019-11-23 22:49:01,843 INFO L226 Difference]: Without dead ends: 137 [2019-11-23 22:49:01,847 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-23 22:49:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-23 22:49:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-23 22:49:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-23 22:49:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-11-23 22:49:01,903 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2019-11-23 22:49:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:01,903 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-11-23 22:49:01,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-11-23 22:49:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:49:01,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:01,906 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-23 22:49:01,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-23 22:49:01,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:01,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283037069] [2019-11-23 22:49:01,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:01,960 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-23 22:49:01,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283037069] [2019-11-23 22:49:01,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:01,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:01,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689139348] [2019-11-23 22:49:01,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:01,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:01,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:01,964 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2019-11-23 22:49:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,061 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2019-11-23 22:49:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:49:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,066 INFO L225 Difference]: With dead ends: 363 [2019-11-23 22:49:02,066 INFO L226 Difference]: Without dead ends: 232 [2019-11-23 22:49:02,068 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-23 22:49:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-23 22:49:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-11-23 22:49:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-23 22:49:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-11-23 22:49:02,100 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2019-11-23 22:49:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,100 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-11-23 22:49:02,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-11-23 22:49:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:49:02,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,103 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-23 22:49:02,103 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-23 22:49:02,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685724412] [2019-11-23 22:49:02,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,170 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-23 22:49:02,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685724412] [2019-11-23 22:49:02,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:02,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974410786] [2019-11-23 22:49:02,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,174 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-11-23 22:49:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,226 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2019-11-23 22:49:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:49:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,229 INFO L225 Difference]: With dead ends: 453 [2019-11-23 22:49:02,229 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:49:02,230 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-23 22:49:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:49:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-23 22:49:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-23 22:49:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2019-11-23 22:49:02,250 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2019-11-23 22:49:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,250 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2019-11-23 22:49:02,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2019-11-23 22:49:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:49:02,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,252 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-23 22:49:02,252 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-23 22:49:02,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852669575] [2019-11-23 22:49:02,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,283 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-23 22:49:02,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852669575] [2019-11-23 22:49:02,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:02,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804861158] [2019-11-23 22:49:02,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,285 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand 3 states. [2019-11-23 22:49:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,328 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2019-11-23 22:49:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:49:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,331 INFO L225 Difference]: With dead ends: 452 [2019-11-23 22:49:02,331 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:49:02,332 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-23 22:49:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:49:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-23 22:49:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-23 22:49:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2019-11-23 22:49:02,348 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2019-11-23 22:49:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,349 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2019-11-23 22:49:02,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2019-11-23 22:49:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:49:02,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,350 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-23 22:49:02,351 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-23 22:49:02,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723863515] [2019-11-23 22:49:02,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,379 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-23 22:49:02,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723863515] [2019-11-23 22:49:02,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:02,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022275779] [2019-11-23 22:49:02,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,382 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 3 states. [2019-11-23 22:49:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,429 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2019-11-23 22:49:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:49:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,431 INFO L225 Difference]: With dead ends: 451 [2019-11-23 22:49:02,432 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:49:02,432 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-23 22:49:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:49:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-23 22:49:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-23 22:49:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 305 transitions. [2019-11-23 22:49:02,446 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 305 transitions. Word has length 39 [2019-11-23 22:49:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,446 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 305 transitions. [2019-11-23 22:49:02,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2019-11-23 22:49:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:49:02,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,448 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-23 22:49:02,448 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-23 22:49:02,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373589589] [2019-11-23 22:49:02,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,510 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-23 22:49:02,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373589589] [2019-11-23 22:49:02,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:02,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941589882] [2019-11-23 22:49:02,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,513 INFO L87 Difference]: Start difference. First operand 230 states and 305 transitions. Second operand 3 states. [2019-11-23 22:49:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,595 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2019-11-23 22:49:02,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:49:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,600 INFO L225 Difference]: With dead ends: 638 [2019-11-23 22:49:02,600 INFO L226 Difference]: Without dead ends: 419 [2019-11-23 22:49:02,602 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-23 22:49:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-11-23 22:49:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2019-11-23 22:49:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-23 22:49:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 517 transitions. [2019-11-23 22:49:02,623 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 517 transitions. Word has length 39 [2019-11-23 22:49:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 517 transitions. [2019-11-23 22:49:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 517 transitions. [2019-11-23 22:49:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:49:02,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,626 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-23 22:49:02,626 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1499945056, now seen corresponding path program 1 times [2019-11-23 22:49:02,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609094122] [2019-11-23 22:49:02,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,699 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-23 22:49:02,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609094122] [2019-11-23 22:49:02,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:02,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39348324] [2019-11-23 22:49:02,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,704 INFO L87 Difference]: Start difference. First operand 395 states and 517 transitions. Second operand 3 states. [2019-11-23 22:49:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,775 INFO L93 Difference]: Finished difference Result 1095 states and 1440 transitions. [2019-11-23 22:49:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:49:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,779 INFO L225 Difference]: With dead ends: 1095 [2019-11-23 22:49:02,780 INFO L226 Difference]: Without dead ends: 717 [2019-11-23 22:49:02,781 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-23 22:49:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-23 22:49:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 687. [2019-11-23 22:49:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-11-23 22:49:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 897 transitions. [2019-11-23 22:49:02,820 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 897 transitions. Word has length 63 [2019-11-23 22:49:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,820 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 897 transitions. [2019-11-23 22:49:02,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 897 transitions. [2019-11-23 22:49:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:49:02,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,822 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-23 22:49:02,822 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1803857567, now seen corresponding path program 1 times [2019-11-23 22:49:02,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684725323] [2019-11-23 22:49:02,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,890 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-23 22:49:02,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684725323] [2019-11-23 22:49:02,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:02,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093272846] [2019-11-23 22:49:02,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,893 INFO L87 Difference]: Start difference. First operand 687 states and 897 transitions. Second operand 3 states. [2019-11-23 22:49:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:03,013 INFO L93 Difference]: Finished difference Result 1933 states and 2521 transitions. [2019-11-23 22:49:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:03,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:49:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:03,020 INFO L225 Difference]: With dead ends: 1933 [2019-11-23 22:49:03,020 INFO L226 Difference]: Without dead ends: 1271 [2019-11-23 22:49:03,022 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-23 22:49:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-11-23 22:49:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1257. [2019-11-23 22:49:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-11-23 22:49:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1607 transitions. [2019-11-23 22:49:03,085 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1607 transitions. Word has length 63 [2019-11-23 22:49:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:03,085 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 1607 transitions. [2019-11-23 22:49:03,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1607 transitions. [2019-11-23 22:49:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 22:49:03,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:03,087 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-23 22:49:03,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash -45669778, now seen corresponding path program 1 times [2019-11-23 22:49:03,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:03,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244996247] [2019-11-23 22:49:03,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:03,122 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-23 22:49:03,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244996247] [2019-11-23 22:49:03,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:03,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:03,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021944466] [2019-11-23 22:49:03,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:03,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:03,125 INFO L87 Difference]: Start difference. First operand 1257 states and 1607 transitions. Second operand 3 states. [2019-11-23 22:49:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:03,259 INFO L93 Difference]: Finished difference Result 3544 states and 4519 transitions. [2019-11-23 22:49:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:03,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-23 22:49:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:03,270 INFO L225 Difference]: With dead ends: 3544 [2019-11-23 22:49:03,271 INFO L226 Difference]: Without dead ends: 2312 [2019-11-23 22:49:03,273 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-23 22:49:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-11-23 22:49:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2019-11-23 22:49:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-23 22:49:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2876 transitions. [2019-11-23 22:49:03,383 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2876 transitions. Word has length 64 [2019-11-23 22:49:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:03,383 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2876 transitions. [2019-11-23 22:49:03,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2876 transitions. [2019-11-23 22:49:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 22:49:03,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:03,387 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-23 22:49:03,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 460727628, now seen corresponding path program 1 times [2019-11-23 22:49:03,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:03,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634532220] [2019-11-23 22:49:03,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:03,467 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-23 22:49:03,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634532220] [2019-11-23 22:49:03,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:03,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:03,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079302971] [2019-11-23 22:49:03,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:03,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:03,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:03,470 INFO L87 Difference]: Start difference. First operand 2312 states and 2876 transitions. Second operand 3 states. [2019-11-23 22:49:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:03,595 INFO L93 Difference]: Finished difference Result 4080 states and 5097 transitions. [2019-11-23 22:49:03,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:03,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 22:49:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:03,608 INFO L225 Difference]: With dead ends: 4080 [2019-11-23 22:49:03,609 INFO L226 Difference]: Without dead ends: 2324 [2019-11-23 22:49:03,614 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-23 22:49:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-11-23 22:49:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2264. [2019-11-23 22:49:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-23 22:49:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2740 transitions. [2019-11-23 22:49:03,724 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2740 transitions. Word has length 93 [2019-11-23 22:49:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:03,732 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2740 transitions. [2019-11-23 22:49:03,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2740 transitions. [2019-11-23 22:49:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:03,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:03,741 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-23 22:49:03,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash -491999912, now seen corresponding path program 1 times [2019-11-23 22:49:03,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:03,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196665613] [2019-11-23 22:49:03,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:03,795 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-23 22:49:03,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196665613] [2019-11-23 22:49:03,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:03,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:03,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624247280] [2019-11-23 22:49:03,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:03,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:03,797 INFO L87 Difference]: Start difference. First operand 2264 states and 2740 transitions. Second operand 3 states. [2019-11-23 22:49:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:03,949 INFO L93 Difference]: Finished difference Result 4484 states and 5430 transitions. [2019-11-23 22:49:03,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:03,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:03,960 INFO L225 Difference]: With dead ends: 4484 [2019-11-23 22:49:03,961 INFO L226 Difference]: Without dead ends: 2266 [2019-11-23 22:49:03,964 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-23 22:49:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-11-23 22:49:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-11-23 22:49:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-23 22:49:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2700 transitions. [2019-11-23 22:49:04,063 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2700 transitions. Word has length 94 [2019-11-23 22:49:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:04,063 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2700 transitions. [2019-11-23 22:49:04,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2700 transitions. [2019-11-23 22:49:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:04,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:04,068 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-23 22:49:04,068 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2077878383, now seen corresponding path program 1 times [2019-11-23 22:49:04,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:04,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849168169] [2019-11-23 22:49:04,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:04,129 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-23 22:49:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849168169] [2019-11-23 22:49:04,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:04,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:04,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571054528] [2019-11-23 22:49:04,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:04,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:04,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:04,132 INFO L87 Difference]: Start difference. First operand 2264 states and 2700 transitions. Second operand 5 states. [2019-11-23 22:49:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:04,382 INFO L93 Difference]: Finished difference Result 4182 states and 5007 transitions. [2019-11-23 22:49:04,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:04,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-23 22:49:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:04,393 INFO L225 Difference]: With dead ends: 4182 [2019-11-23 22:49:04,393 INFO L226 Difference]: Without dead ends: 1933 [2019-11-23 22:49:04,397 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-23 22:49:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-11-23 22:49:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1745. [2019-11-23 22:49:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-11-23 22:49:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2049 transitions. [2019-11-23 22:49:04,546 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2049 transitions. Word has length 94 [2019-11-23 22:49:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:04,547 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 2049 transitions. [2019-11-23 22:49:04,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2049 transitions. [2019-11-23 22:49:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:04,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:04,549 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-23 22:49:04,550 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:04,550 INFO L82 PathProgramCache]: Analyzing trace with hash -267062732, now seen corresponding path program 1 times [2019-11-23 22:49:04,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:04,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873297867] [2019-11-23 22:49:04,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:04,623 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-23 22:49:04,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873297867] [2019-11-23 22:49:04,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:04,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:04,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540104255] [2019-11-23 22:49:04,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:04,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:04,626 INFO L87 Difference]: Start difference. First operand 1745 states and 2049 transitions. Second operand 3 states. [2019-11-23 22:49:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:04,746 INFO L93 Difference]: Finished difference Result 2952 states and 3474 transitions. [2019-11-23 22:49:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:04,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:04,753 INFO L225 Difference]: With dead ends: 2952 [2019-11-23 22:49:04,753 INFO L226 Difference]: Without dead ends: 1232 [2019-11-23 22:49:04,755 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-23 22:49:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-23 22:49:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1224. [2019-11-23 22:49:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-23 22:49:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1403 transitions. [2019-11-23 22:49:04,830 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1403 transitions. Word has length 94 [2019-11-23 22:49:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:04,832 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1403 transitions. [2019-11-23 22:49:04,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1403 transitions. [2019-11-23 22:49:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:49:04,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:04,834 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-23 22:49:04,834 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1230973766, now seen corresponding path program 1 times [2019-11-23 22:49:04,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:04,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600363427] [2019-11-23 22:49:04,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:04,901 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-23 22:49:04,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600363427] [2019-11-23 22:49:04,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:04,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:04,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392554547] [2019-11-23 22:49:04,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:04,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:04,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:04,905 INFO L87 Difference]: Start difference. First operand 1224 states and 1403 transitions. Second operand 5 states. [2019-11-23 22:49:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:05,058 INFO L93 Difference]: Finished difference Result 2222 states and 2544 transitions. [2019-11-23 22:49:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:05,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-23 22:49:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:05,061 INFO L225 Difference]: With dead ends: 2222 [2019-11-23 22:49:05,062 INFO L226 Difference]: Without dead ends: 648 [2019-11-23 22:49:05,065 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-23 22:49:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-23 22:49:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 582. [2019-11-23 22:49:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-23 22:49:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2019-11-23 22:49:05,101 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 95 [2019-11-23 22:49:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:05,102 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2019-11-23 22:49:05,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2019-11-23 22:49:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:49:05,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:05,105 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-23 22:49:05,105 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2019-11-23 22:49:05,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:05,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707364583] [2019-11-23 22:49:05,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:05,242 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-23 22:49:05,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707364583] [2019-11-23 22:49:05,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:05,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:49:05,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750954785] [2019-11-23 22:49:05,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:49:05,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:49:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:49:05,244 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2019-11-23 22:49:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:05,315 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2019-11-23 22:49:05,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:49:05,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-23 22:49:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:05,316 INFO L225 Difference]: With dead ends: 586 [2019-11-23 22:49:05,317 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:49:05,321 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-23 22:49:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:49:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:49:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:49:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:49:05,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-23 22:49:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:49:05,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:49:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:49:05,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:49:05,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:49:06,801 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:07,106 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:07,401 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:07,642 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:07,897 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:08,139 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:08,334 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-23 22:49:08,543 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:09,041 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:09,248 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:09,453 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-23 22:49:09,808 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:10,041 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:10,190 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-11-23 22:49:10,416 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-23 22:49:10,708 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-23 22:49:11,012 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:11,228 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:11,605 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:11,838 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:12,055 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:12,294 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:12,500 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-23 22:49:12,709 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-23 22:49:12,933 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-23 22:49:13,180 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:13,501 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 22:49:13,698 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-23 22:49:13,834 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-23 22:49:14,053 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-11-23 22:49:14,278 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-23 22:49:14,572 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-23 22:49:14,577 INFO L440 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,577 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-23 22:49:14,578 INFO L440 ceAbstractionStarter]: At program point L400(lines 384 402) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,578 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-23 22:49:14,578 INFO L440 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (and (<= 2 ~E_M~0) (= 1 ~t1_pc~0) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~T1_E~0) (< ~local~0 ~token~0) (= ~t1_i~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~t1_st~0) (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) (<= 2 ~E_1~0) (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) [2019-11-23 22:49:14,578 INFO L444 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-11-23 22:49:14,579 INFO L444 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-11-23 22:49:14,579 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-11-23 22:49:14,579 INFO L440 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,579 INFO L440 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,580 INFO L440 ceAbstractionStarter]: At program point L471(lines 462 473) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-23 22:49:14,580 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-23 22:49:14,580 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,580 INFO L444 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,580 INFO L444 ceAbstractionStarter]: For program point L309-3(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,580 INFO L440 ceAbstractionStarter]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,581 INFO L440 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-11-23 22:49:14,581 INFO L444 ceAbstractionStarter]: For program point L309-5(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,581 INFO L440 ceAbstractionStarter]: 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-23 22:49:14,581 INFO L444 ceAbstractionStarter]: For program point L309-6(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,581 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-11-23 22:49:14,582 INFO L440 ceAbstractionStarter]: At program point L144-2(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse4))) [2019-11-23 22:49:14,582 INFO L444 ceAbstractionStarter]: For program point L309-8(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,582 INFO L440 ceAbstractionStarter]: At program point L144-3(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse14 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse14 .cse8 .cse3 .cse15 .cse5 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse8 .cse3 .cse15 .cse9 .cse5 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse11 .cse12)))) [2019-11-23 22:49:14,582 INFO L444 ceAbstractionStarter]: For program point L309-9(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,583 INFO L440 ceAbstractionStarter]: At program point L144-4(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse14 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse14 .cse8 .cse3 .cse16 .cse5 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse7 .cse8 .cse3 .cse16 .cse9 .cse5 .cse10 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse16 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse16 .cse5 .cse15 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse16 .cse5 .cse6 .cse11 .cse12)))) [2019-11-23 22:49:14,583 INFO L444 ceAbstractionStarter]: For program point L309-11(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,583 INFO L444 ceAbstractionStarter]: For program point L309-12(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,583 INFO L444 ceAbstractionStarter]: For program point L309-14(lines 309 313) no Hoare annotation was computed. [2019-11-23 22:49:14,583 INFO L440 ceAbstractionStarter]: At program point L343(lines 337 345) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,583 INFO L444 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-11-23 22:49:14,584 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-11-23 22:49:14,584 INFO L444 ceAbstractionStarter]: For program point L277-3(lines 276 299) no Hoare annotation was computed. [2019-11-23 22:49:14,584 INFO L440 ceAbstractionStarter]: At program point L145(lines 129 147) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-11-23 22:49:14,584 INFO L444 ceAbstractionStarter]: For program point L178-1(lines 178 188) no Hoare annotation was computed. [2019-11-23 22:49:14,584 INFO L440 ceAbstractionStarter]: 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-23 22:49:14,584 INFO L444 ceAbstractionStarter]: For program point L178-2(lines 178 188) no Hoare annotation was computed. [2019-11-23 22:49:14,585 INFO L440 ceAbstractionStarter]: At program point L145-2(lines 129 147) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse7 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4))) [2019-11-23 22:49:14,585 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 22:49:14,585 INFO L440 ceAbstractionStarter]: At program point L145-3(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse17 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse16 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse0 .cse17 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse12 .cse13) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse12 .cse13)))) [2019-11-23 22:49:14,585 INFO L440 ceAbstractionStarter]: At program point L145-4(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse17 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse16 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse0 .cse17 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse12 .cse13) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse12 .cse13)))) [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,586 INFO L444 ceAbstractionStarter]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-11-23 22:49:14,587 INFO L440 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= 1 ~t1_pc~0) .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 (<= ~local~0 ~token~0) .cse7))) [2019-11-23 22:49:14,587 INFO L444 ceAbstractionStarter]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 182 187) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L440 ceAbstractionStarter]: At program point L381(lines 374 383) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= 1 ~t1_pc~0)) (<= 2 ~T1_E~0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-11-23 22:49:14,588 INFO L444 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point L282-3(lines 276 299) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point L249-4(lines 248 271) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-11-23 22:49:14,589 INFO L440 ceAbstractionStarter]: At program point L317-2(lines 277 281) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-11-23 22:49:14,589 INFO L444 ceAbstractionStarter]: For program point L317-3(lines 317 321) no Hoare annotation was computed. [2019-11-23 22:49:14,590 INFO L440 ceAbstractionStarter]: At program point L317-5(lines 1 473) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.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-23 22:49:14,590 INFO L444 ceAbstractionStarter]: For program point L317-6(lines 317 321) no Hoare annotation was computed. [2019-11-23 22:49:14,590 INFO L440 ceAbstractionStarter]: At program point L317-8(lines 1 473) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4 .cse8) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse7 .cse4 .cse8))) [2019-11-23 22:49:14,590 INFO L444 ceAbstractionStarter]: For program point L317-9(lines 317 321) no Hoare annotation was computed. [2019-11-23 22:49:14,590 INFO L440 ceAbstractionStarter]: At program point L317-11(lines 277 281) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,591 INFO L444 ceAbstractionStarter]: For program point L317-12(lines 317 321) no Hoare annotation was computed. [2019-11-23 22:49:14,591 INFO L440 ceAbstractionStarter]: At program point L317-14(lines 350 354) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,591 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-11-23 22:49:14,591 INFO L440 ceAbstractionStarter]: At program point L153(lines 160 164) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= 1 ~t1_pc~0)) (<= 2 ~T1_E~0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-11-23 22:49:14,592 INFO L440 ceAbstractionStarter]: At program point L153-1(lines 148 155) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,592 INFO L440 ceAbstractionStarter]: At program point L418-1(lines 273 455) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,592 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 22:49:14,592 INFO L444 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-11-23 22:49:14,592 INFO L444 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-11-23 22:49:14,592 INFO L444 ceAbstractionStarter]: For program point L287-3(lines 276 299) no Hoare annotation was computed. [2019-11-23 22:49:14,592 INFO L444 ceAbstractionStarter]: For program point L254-3(lines 248 271) no Hoare annotation was computed. [2019-11-23 22:49:14,593 INFO L440 ceAbstractionStarter]: 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-23 22:49:14,593 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-23 22:49:14,593 INFO L444 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-11-23 22:49:14,593 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:49:14,593 INFO L440 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,594 INFO L440 ceAbstractionStarter]: At program point L190-1(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,594 INFO L440 ceAbstractionStarter]: At program point L190-2(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,594 INFO L440 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,595 INFO L440 ceAbstractionStarter]: At program point L191(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,595 INFO L440 ceAbstractionStarter]: At program point L191-1(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,595 INFO L440 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-23 22:49:14,595 INFO L440 ceAbstractionStarter]: At program point L191-2(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,596 INFO L440 ceAbstractionStarter]: At program point L125-1(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 (= 0 ~t1_st~0) .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 (<= ~local~0 ~token~0)))) [2019-11-23 22:49:14,596 INFO L440 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse5 (<= 2 ~t1_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse9 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse8) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) (not .cse1) (= 0 ULTIMATE.start_activate_threads_~tmp~1) .cse9 .cse3 (= 0 ~t1_st~0) .cse8 .cse0 .cse2 .cse4 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)))) [2019-11-23 22:49:14,596 INFO L440 ceAbstractionStarter]: At program point L125-2(lines 113 127) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-23 22:49:14,596 INFO L440 ceAbstractionStarter]: At program point L125-3(lines 113 127) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse15 (not .cse0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t1_st~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_1~0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse6 .cse2 .cse13 .cse3 .cse14 .cse10 .cse11) (and .cse5 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse1 (< ~local~0 ~token~0) .cse3 .cse8 .cse9 .cse4 .cse10 .cse11) (and .cse5 .cse6 .cse2 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse15 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse15 .cse6 .cse13 .cse3 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse5 .cse0 .cse6 .cse13 .cse7 .cse3 .cse14 .cse10 .cse11 .cse12) (and .cse5 .cse0 .cse6 .cse13 .cse3 .cse4 .cse10 .cse11)))) [2019-11-23 22:49:14,597 INFO L440 ceAbstractionStarter]: At program point L125-4(lines 113 127) the Hoare annotation is: (let ((.cse8 (= 1 ~t1_pc~0))) (let ((.cse10 (<= 2 ~t1_st~0)) (.cse9 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse15 (not .cse8)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse5 (= 0 ~t1_st~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 .cse4 .cse10 .cse0 .cse1 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse9 (< ~local~0 ~token~0) .cse4 .cse12 .cse13 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse12 .cse13 .cse10 .cse6 .cse7) (and .cse15 .cse9 .cse2 .cse4 .cse5 .cse0 .cse1 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse15 .cse1 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7 .cse14)))) [2019-11-23 22:49:14,597 INFO L440 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-23 22:49:14,597 INFO L440 ceAbstractionStarter]: At program point L126(lines 110 128) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse6 (<= 2 ~T1_E~0)) (.cse2 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse7 (<= 2 ~M_E~0)) (.cse4 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) .cse7 .cse8 .cse9 (<= ~local~0 ~token~0)) (and .cse5 .cse0 .cse1 .cse6 .cse2 (<= 2 ~m_st~0) .cse3 .cse7 .cse4 .cse8 .cse9))) [2019-11-23 22:49:14,597 INFO L440 ceAbstractionStarter]: At program point L126-1(lines 110 128) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 (<= 2 ~t1_st~0) .cse7 (<= ~local~0 ~token~0)))) [2019-11-23 22:49:14,597 INFO L440 ceAbstractionStarter]: At program point L126-2(lines 110 128) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse0 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6))) [2019-11-23 22:49:14,598 INFO L440 ceAbstractionStarter]: At program point L126-3(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.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-23 22:49:14,598 INFO L440 ceAbstractionStarter]: At program point L126-4(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.cse1 (not .cse14)) (.cse16 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse13 (<= ~local~0 ~token~0)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse14 .cse7 .cse15 .cse4 .cse9 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse14 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse7 .cse15 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12) (and .cse6 .cse0 .cse7 .cse3 .cse15 .cse4 .cse16 .cse11 .cse12) (and .cse0 .cse6 .cse7 .cse15 .cse8 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse7 .cse3 .cse15 .cse4 .cse5 .cse11 .cse12)))) [2019-11-23 22:49:14,598 INFO L444 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-11-23 22:49:14,598 INFO L440 ceAbstractionStarter]: At program point L292-3(lines 273 300) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-23 22:49:14,598 INFO L444 ceAbstractionStarter]: For program point L259-3(lines 248 271) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-23 22:49:14,599 INFO L440 ceAbstractionStarter]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7))) [2019-11-23 22:49:14,600 INFO L440 ceAbstractionStarter]: At program point L264-3(lines 245 272) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-23 22:49:14,600 INFO L440 ceAbstractionStarter]: At program point L165-1(lines 249 253) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7))) [2019-11-23 22:49:14,600 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,600 INFO L444 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,600 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-23 22:49:14,600 INFO L444 ceAbstractionStarter]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,600 INFO L444 ceAbstractionStarter]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-11-23 22:49:14,601 INFO L444 ceAbstractionStarter]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-11-23 22:49:14,602 INFO L444 ceAbstractionStarter]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-11-23 22:49:14,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:49:14 BoogieIcfgContainer [2019-11-23 22:49:14,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:49:14,688 INFO L168 Benchmark]: Toolchain (without parser) took 14471.54 ms. Allocated memory was 137.9 MB in the beginning and 471.9 MB in the end (delta: 334.0 MB). Free memory was 102.3 MB in the beginning and 215.5 MB in the end (delta: -113.2 MB). Peak memory consumption was 351.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:14,688 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 22:49:14,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.52 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 178.3 MB in the end (delta: -76.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:14,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.94 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 176.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:14,690 INFO L168 Benchmark]: Boogie Preprocessor took 35.55 ms. Allocated memory is still 201.3 MB. Free memory was 176.4 MB in the beginning and 173.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:14,691 INFO L168 Benchmark]: RCFGBuilder took 725.62 ms. Allocated memory is still 201.3 MB. Free memory was 173.4 MB in the beginning and 135.8 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:14,692 INFO L168 Benchmark]: TraceAbstraction took 13190.07 ms. Allocated memory was 201.3 MB in the beginning and 471.9 MB in the end (delta: 270.5 MB). Free memory was 135.8 MB in the beginning and 215.5 MB in the end (delta: -79.7 MB). Peak memory consumption was 321.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:14,697 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.79 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 453.52 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 178.3 MB in the end (delta: -76.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.94 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 176.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.55 ms. Allocated memory is still 201.3 MB. Free memory was 176.4 MB in the beginning and 173.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 725.62 ms. Allocated memory is still 201.3 MB. Free memory was 173.4 MB in the beginning and 135.8 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13190.07 ms. Allocated memory was 201.3 MB in the beginning and 471.9 MB in the end (delta: 270.5 MB). Free memory was 135.8 MB in the beginning and 215.5 MB in the end (delta: -79.7 MB). Peak memory consumption was 321.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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: 13.0s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, 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.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2312occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 394 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 650 NumberOfFragments, 10234 HoareAnnotationTreeSize, 52 FomulaSimplifications, 19297 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 635 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 126390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 203/203 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...